Sciweavers

334 search results - page 25 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
Pose Clustering Guided by Short Interpretation Trees
It is common in object recognition algorithms based on viewpoint consistency to find object poses that align many of the object features with features extracted from a search imag...
Clark F. Olson
FOCS
1992
IEEE
14 years 16 days ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
ICML
2006
IEEE
14 years 9 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
DAC
2003
ACM
14 years 9 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...