Sciweavers

536 search results - page 48 / 108
» Efficient Search Using Bitboard Models
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Using Particles to Track Varying Numbers of Interacting People
In this paper, we present a Bayesian framework for the fully automatic tracking of a variable number of interacting targets using a fixed camera. This framework uses a joint multi...
Kevin Smith, Daniel Gatica-Perez, Jean-Marc Odobez
NIPS
2001
13 years 9 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 7 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
CVPR
2009
IEEE
1216views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Marked Point Processes for Crowd Counting
A Bayesian marked point process (MPP) model is developed to detect and count people in crowded scenes. The model couples a spatial stochastic process governing number and placem...
Robert T. Collins, Weina Ge
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...