Sciweavers

4843 search results - page 844 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
EDBT
2009
ACM
124views Database» more  EDBT 2009»
15 years 6 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...
SCA
2007
15 years 5 months ago
Animation collage
We propose a method to automatically transform mesh animations into animation collages, i.e. moving assemblies of shape primitives from a database given by an artist. An animation...
Christian Theobalt, Christian Rössl, Edilson ...
BMVC
2002
15 years 5 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
AAAI
2008
15 years 5 months ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu