9842 search results - page 1423 / 1969 » The Complexity of the Matching-Cut Problem |
330
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
326
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
201
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
164
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
197
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...