4860 search results - page 775 / 972 » SNPs Problems, Complexity, and Algorithms |
165
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
170
click to vote
IJAR
2006
15 years 6 months ago
2006
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
223
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
199
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
170
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...