4110 search results - page 682 / 822 » Efficient algorithms for the 2-gathering problem |
247
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
205
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
148
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
129
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
146
Voted
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
The development of efficient parallel algorithms for large scale wildfire simulations is a challenging research problem because the factors that determine wildfire behavior are com...