Sciweavers

1566 search results - page 170 / 314
» On a Cone Covering Problem
Sort
View
FOCS
2008
IEEE
15 years 11 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
GLOBECOM
2007
IEEE
15 years 10 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
ILP
2003
Springer
15 years 9 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
INFOCOM
2002
IEEE
15 years 9 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally
CRYPTO
2001
Springer
202views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
Dalit Naor, Moni Naor, Jeffery Lotspiech