Sciweavers

202 search results - page 20 / 41
» A more efficient approximation scheme for tree alignment
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Switching Particle Filters for Efficient Real-time Visual Tracking
Particle filtering is an approach to Bayesian estimation of intractable posterior distributions from time series signals distributed by non-Gaussian noise. A couple of variant par...
Kenji Doya, Shin Ishii, Takashi Bando, Tomohiro Sh...
TCAD
2008
119views more  TCAD 2008»
13 years 7 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 7 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...