Sciweavers

208 search results - page 17 / 42
» Efficient Computation of Multiple Group By Queries
Sort
View
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
14 years 7 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
CVPR
2009
IEEE
15 years 2 months ago
Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In general, shapecorrespondenc...
Andrew Temlyakov, Brent C. Munsell, Song Wang
ICCV
2009
IEEE
13 years 5 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...
DMSN
2006
ACM
13 years 11 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
AI
2008
Springer
13 years 7 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson