8917 search results - page 1652 / 1784 » Abstraction in Algorithm Animation |
128
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
135
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
128
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. 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) ...
160
click to vote
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...