Sciweavers

853 search results - page 9 / 171
» Are many small sets explicitly small
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
DCOSS
2005
Springer
15 years 11 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
DAGSTUHL
2004
15 years 7 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan
FMCO
2007
Springer
103views Formal Methods» more  FMCO 2007»
15 years 12 months ago
Safety Guarantees from Explicit Resource Management
We present a language and a program analysis that certifies the safe use of flexible resource management idioms, in particular advance reservation or “block booking” of costl...
David Aspinall, Patrick Maier, Ian Stark
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 7 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold