Sciweavers

31 search results - page 1 / 7
» Counting Unique-Sink Orientations
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
12 years 11 months ago
Counting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Mark...
CIE
2008
Springer
13 years 6 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani
COMPGEOM
2003
ACM
13 years 9 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
CVPR
2009
IEEE
1216views Computer Vision» more  CVPR 2009»
14 years 11 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
ICWS
2009
IEEE
13 years 2 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang