Sciweavers

14403 search results - page 41 / 2881
» Dynamical Systems Trees
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
IUI
2005
ACM
14 years 3 months ago
Task aware information access for diagnosis of manufacturing problems
Pinpoint is a promising first step towards using a rich model of task context in proactive and dynamic IR systems. Pinpoint allows a user to navigate decision tree representations...
Larry Birnbaum, Wallace J. Hopp, Seyed M. R. Irava...
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 11 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
INFOCOM
2002
IEEE
14 years 2 months ago
Design and Scalability of NLS, a Scalable Naming and Location Service
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...
Y. Charlie Hu, Daniel Rodney, Peter Druschel