2924 search results - page 192 / 585 » Lower Bounds in Distributed Computing |
137
click to vote
MONET
2007
15 years 2 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
137
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
205
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
121
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
129
click to vote
CASES
2009
ACM
15 years 1 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...