1973 search results - page 212 / 395 » The Construction of Ludic Space |
154
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
199
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
191
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
248
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
172
click to vote
WACV
2005
IEEE
16 years 2 months ago
2005
IEEE
To facilitate accurate and efficient detection of motion
patterns in video data, it is desirable to abstract from pixel
intensity values to representations that explicitly and co...