603 search results - page 110 / 121 » A General Approximation Technique for Constrained Forest Pro... |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
103
click to vote
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
PODS
2000
ACM
15 years 1 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
84
Voted
IMC
2007
ACM
14 years 11 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...