10890 search results - page 2016 / 2178 » Automatic Complexity Analysis |
124
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
119
Voted
KDD
2005
ACM
16 years 2 months ago
2005
ACM
We propose a new class of spatio-temporal cluster detection methods designed for the rapid detection of emerging space-time clusters. We focus on the motivating application of pro...
138
Voted
KDD
2005
ACM
16 years 2 months ago
2005
ACM
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
241
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
225
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...