Sciweavers

5658 search results - page 24 / 1132
» An Efficient Counting Network
Sort
View
NIPS
2008
13 years 11 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
CVPR
2009
IEEE
1216views Computer Vision» more  CVPR 2009»
15 years 4 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
ICIP
2009
IEEE
13 years 7 months ago
K-means based segmentation for real-time zenithal people counting
The paper presents an efficient and reliable approach to automatic people segmentation, tracking and counting, designed for a system with an overhead mounted (zenithal) camera. Up...
Borislav Antic, Dragan Letic, Dubravko Culibrk, Vl...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DCC
2004
IEEE
14 years 9 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...