4850 search results - page 172 / 970 » Approximate Data Structures with Applications |
138
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
128
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Wedescribe an industrial-strength data mining application in telecommunications.Theapplication requires building a short (7 byte) profile for all telephonenumbersseen on a large t...
176
Voted
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
189
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
225
Voted
MST
2010
15 years 27 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...