683 search results - page 78 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
ICSE
2001
IEEE-ACM
14 years 10 days ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
BCI
2009
IEEE
14 years 2 months ago
2009
IEEE
—Efficient management of massive data sets is a key aspect in typical grid and e-science applications. To this end, the benefits of employing database technologies in such appl...
PVLDB
2010
13 years 2 months ago
2010
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
Malware authors have recently begun using emulation technology to obfuscate their code. They convert native malware binaries into bytecode programs written in a randomly generated...
STOC
1996
ACM
14 years 23 hour ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...