The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
H. A. V. RANSOM. 192G. xvi + 283 pp. Dent. 6s. Histories: Book II. The Middle Ages [1066–1485]. By C. H. K. MARTEN and E. H. CARTER

1926
*
History: The Journal of the Historical Association
*

By

doi:10.1111/j.1468-229x.1926.tb00481.x
fatcat:nutyovidsbak5ey5y26kl5iscu
*H*. A. V. Ransom. 1926. xvi+ 283 pp. Dent. 6s. Histories: Book II.*The*Middle Ages [1066-1485]. By C.*H*.*K*. ae and E.*H*. Carrer. [1926.] xii+ 212 pp. Blackwell. 6d Outlines of European History. ... Native*problem*). ...##
###
Voltage coupling of primary H+ V-ATPases to secondary Na+- or K+-dependent transporters

2009
*
Journal of Experimental Biology
*

(Beyenbach and Wieczorek, 2006; Harvey and Wieczorek, 1997; Wieczorek et al., 2009 ) and we will examine

doi:10.1242/jeb.031534
pmid:19448072
pmcid:PMC2683009
fatcat:mvb54bvqubcnjfrrdxf4v3ukly
*one*of them in*depth*. ...*The*insect*K*+ -pump is an*H*+ V-ATPase-*K*+ /2H + antiporter hybrid Had*the*focus*on**K*+ rather than*H*+ led*the*field astray for two decades?*The*answer is no! ...##
###
Efficient collision detection using bounding volume hierarchies of k-DOPs

1998
*
IEEE Transactions on Visualization and Computer Graphics
*

We compare a variety of methods for constructing hierarchies ("BV-

doi:10.1109/2945.675649
fatcat:zuy3tmxsgjdtndtb5n5rrzdot4
*trees*") of*bounding**k*-dops. ... Further, we propose algorithms for maintaining an effective BV-*tree*of*k*-dops for moving objects, as they rotate, and for performing fast collision detection using BV-*trees*of*the*moving objects and of ... ACKNOWLEDGMENTS Our work has greatly benefited from*the*support of*the*VR group at Boeing, including Jeff Heisserman, William McNeely, and David Mizell. ...##
###
Characterizing EVOI-Sufficient k-Response Query Sets in Decision Problems

2014
*
International Conference on Artificial Intelligence and Statistics
*

However, we also provide a positive result that

dblp:conf/aistats/CohnSD14
fatcat:bh3tx2ewevfrdk4jy2f4nsqqge
*the*set of*depth*-n query*trees*constructed from kresponse decision-set queries, which ask*the*user to select from among*k*sets of decisions as to which set ... When multiple queries can be asked before acting, we provide a negative result that shows*the*set of*depth*-n query*trees*constructed from*k*-response decision queries is not EVOI-Sufficient. ... Any opinions, findings, conclusions, or recommendations expressed here are those of*the*authors and do not necessarily reflect*the*views of*the*sponsors. ...##
###
Mining top-K covering rule groups for gene expression data

2005
*
Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05
*

RCBT classifier is constructed from

doi:10.1145/1066157.1066234
dblp:conf/sigmod/CongTTX05
fatcat:cmrlma7aezh7xgbcc3niagdrbi
*the*top-*k*covering rule groups.*The*rule groups generated for building RCBT are*bounded*in number. ... Several experiments*on*real bioinformatics datasets show that*the*new top-*k*covering rule mining algorithm is orders of magnitude faster than previous association rule mining algorithms. ... Acknowledgment: We like to thank*the*anonymous ICDE'2005 reviewers for their comments which have help to improve this paper substantially. ...##
###
A branch and bound algorithm for disassembly scheduling with assembly product structure

2009
*
Journal of the Operational Research Society
*

To obtain an upper

doi:10.1057/palgrave.jors.2602568
fatcat:olk3q6efxvdehl3jyi374sp7ea
*bound*at each node of*the*B&B*tree*,*the*solution of*the*relaxed*problem*[LR] is modified to a feasible*one*. ... Procedure 1 (Obtaining lower and upper*bounds*at each node of*the*B&B*tree*) Step 1: Let w =0, g =0, and /),, = 0 for all parent items i, t and*k*€*H*(i) and all ¢. ...##
###
K-Nearest Neighbor Finding Using MaxNearestDist

2008
*
IEEE Transactions on Pattern Analysis and Machine Intelligence
*

*The*MAXNEARESTDIST upper

*bound*is adapted to enable its use for finding

*the*

*k*nearest neighbors instead of just

*the*nearest neighbor (i.e.,

*k*= 1) as in its previous uses. ... Finding

*the*

*k*nearest neighbors is achieved by applying either a

*depth*-first or a best-first algorithm to

*the*search hierarchy containing

*the*data. ...

*The*

*problem*is that given

*the*way in which

*the*MAX-NEARESTDIST upper

*bound*is defined here, its primary role is to set an upper

*bound*

*on*

*the*distance from

*the*query object to its nearest neighbor in a ...

##
###
Stability Oriented Overlay Multicast for Multimedia Streaming in Multiple Source Context

2008
*
2008 IEEE International Conference on Communications
*

For this purpose, it concentrates

doi:10.1109/icc.2008.1069
dblp:conf/icc/BadugeIYH08
fatcat:kkbiobaq5vhcjaf7lbwtaj6w2a
*on*endhosts' reliability (lifetime for instance) and constructs a shared*tree*called ms-DDBMSST (multiple-source Degree and Delay*Bounded*Maximum Stability Spanning*Tree*... We believe that this is*the*first approach that defines ms-DDBMSST construction*problem*and presents a distributed protocol for*the*purpose. ... (a) (b) w 1*k*'*k*' 2 u 1*k*'+1*k*'' (c) d(w) > d(u) d(u) > d(w)*k*'= d(u) ,*k*"= d(w)*k*"-*k*' δ(x) max = {D max − D(s f , x) −*depth*(T x )}/*H*(s f , x) (x =z) δ(z) max = δ(w j ) max Here,*depth*(T x ) is*the*maximum ...##
###
COnstructing Proxy Records from Age models (COPRA)

2012
*
Climate of the Past
*

<br><br> We present a framework that allows detection and interactive handling of age reversals and hiatuses,

doi:10.5194/cp-8-1765-2012
fatcat:ni2lcwqhgnbejbxyju3hujjnou
*depth*-age modeling, and proxy-record reconstruction. ...*The*presented framework allows integration of incremental relative dating information to improve*the*final age model.*The*free software package COPRA1.0 facilitates easy interactive usage.</p> ... This study was financially supported by*the*Schweizer National Fond (SNF), Sinergia grant CRSI22 132646/1,*the*German Federal Ministry of Education and Research (BMBF project PROGRESS, 03IS2191B), National ...##
###
Manipulating refractive and reflective binocular disparity

2014
*
Computer graphics forum (Print)
*

However, combinations of transparent as well as specular materials are common in

doi:10.1111/cgf.12290
fatcat:w3s7ahmxgncuvfymt2jc577rxm
*the*real and virtual worlds, and pose a significant*problem*. ... Based*on*this representation, we define an optimization to find*the*best per-pixel camera parameters, assuring that all disparities can be easily fused by a human. ... As mentioned,*the*idea could be extended to distribution effects, or to actively change*the*scene such that*depth*perception is optimized. ...##
###
Compressing probabilistic Prolog programs

2007
*
Machine Learning
*

Experiments in

doi:10.1007/s10994-007-5030-x
fatcat:xx4qso6drfdhtgspoe2a5pgkyy
*the*context of discovering links in real biological networks demonstrate*the*practical applicability of*the*approach. 2 L. De Raedt et al. ...*The*semantics of ProbLog is then defined by*the*success probability of a query in a randomly sampled program. ... Hintsanen and*K*. Kulovesi for*the*real data.*K*. Kersting and A. Kimmig have been supported by*the*EU IST FET project April II.*K*. Revoredo has been supported by Brazilian Research Council, CNPq.*H*. ...##
###
Isomorphism for Graphs of Bounded Distance Width

1999
*
Algorithmica
*

In this paper, we study

doi:10.1007/pl00009273
fatcat:ro4qrvev3fbafdmkwcw2usyu7q
*the*Graph Isomorphism*problem**on*graphs of*bounded*treewidth,*bounded*degree or*bounded*bandwidth. ... Additionally, w e show that computing*the*path distance width of a graph is NP-hard, but both path and*tree*distance width can be computed in*On**k*+1 time, when they are*bounded*by a constant*k*;*the*rooted ...*The*nodes of*depth*l are called nodes*on*level l. ...##
###
Classifying the Clique-Width of H-Free Bipartite Graphs
[article]

2014
*
arXiv
*
pre-print

Lozin and Volz characterized all bipartite graphs

arXiv:1402.7060v1
fatcat:sbsahkbxczh3rdngog4vqmecqy
*H*for which*the*class of strongly*H*-free bipartite graphs has*bounded*clique-width. ... Third, G is weakly*H*-free if G is*H*-free or else has at least*one*bipartition (B_G,W_G) with B_H⊆ B_G or W_H⊆ W_G. ... We will say that a graph operation preserves*boundedness*of clique-width if for any constant*k*and any graph class G,*the*graph class G [*k*] obtained by performing*the*operation at most*k*times*on*each ...##
###
Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity

2019
*
SN Computer Science
*

For finite convergence of distributed information dissemination and function computation in

doi:10.1007/s42979-019-0002-3
fatcat:htg5vdr5m5brpm6cn7azoisl2y
*the*model, we present a lower*bound**on**the*number of time-steps for vertices to receive (initial) vertex-values ... We also address lower*bounds**on*vertex-eccentricity and its maximum version in terms of common graphparameters such as maximum degree, and order and size. majority rule (that is, computes*the*indicator ... Our approach in deriving a desired lower*bound**on*|E(G)|, hence*on*dia(G) , relies*on*: (1) embedding in G a vertex-spanning rooted directed*tree*with*depth*of dia(G) , and (2) then relating*the*order | ...##
###
Bounding the Clique-Width of H-free Split Graphs
[article]

2015
*
arXiv
*
pre-print

A graph is

arXiv:1509.04273v1
fatcat:jbv3ad4dhnf2tjohtnd5yyg55q
*H*-free if it has no induced subgraph isomorphic to*H*. We continue a study into*the**boundedness*of clique-width of subclasses of perfect graphs. ... of*H*-free split graphs has*bounded*clique-width. ...*The*graph S*h*,i,j , for 1 ≤*h*≤ i ≤ j, denotes*the*subdivided claw, that is*the**tree*that has only*one*vertex x of degree 3 and exactly three leaves, which are of distance*h*, i and j from x, respectively ...
« Previous

*Showing results 1 — 15 out of 95,398 results*