868 search results - page 131 / 174 » A general compression algorithm that supports fast searching |
DAMON
2008
Springer
13 years 11 months ago
2008
Springer
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
SIGSOFT
2005
ACM
14 years 10 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
ICDM
2010
IEEE
13 years 7 months ago
2010
IEEE
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
CIVR
2007
Springer
14 years 3 months ago
2007
Springer
Among the various types of semantic concepts modeled, events pose the greatest challenge in terms of computational power needed to represent the event and accuracy that can be ach...