Sciweavers

1046 search results - page 114 / 210
» Approximation Algorithms for Domination Search
Sort
View
MMM
2008
Springer
206views Multimedia» more  MMM 2008»
15 years 9 months ago
Content Based Querying and Searching for 3D Human Motions
From cartoons to medical research world, from the field of arts to scientific visualization, everyone related to these areas have been continuously using 3D motion capture data. Qu...
Manoj M. Pawar, Gaurav N. Pradhan, Kang Zhang, Bal...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 2 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
COMPGEOM
2005
ACM
15 years 5 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
IPL
2010
114views more  IPL 2010»
15 years 1 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
CVPR
2007
IEEE
16 years 5 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell