3229 search results - page 550 / 646 » Theories with the Independence Property |
191
click to vote
SENSYS
2004
ACM
16 years 12 days ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
176
click to vote
APPROX
2004
Springer
16 years 11 days ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
272
click to vote
PSSE
2004
Springer
16 years 10 days ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
227
Voted
AGTIVE
2003
Springer
16 years 6 days ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
245
click to vote
COMPGEOM
2010
ACM
16 years 2 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...