Sciweavers

1172 search results - page 61 / 235
» Constructions of generalized Sidon sets
Sort
View
WINE
2009
Springer
138views Economy» more  WINE 2009»
15 years 6 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
ICALP
2010
Springer
15 years 4 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
INFOCOM
2003
IEEE
15 years 5 months ago
Broadcasting in Ad Hoc Networks Based on Self-Pruning
— We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form ...
Jie Wu, Fei Dai
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 1 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
FFA
2006
116views more  FFA 2006»
14 years 12 months ago
Amorphic association schemes with negative Latin square-type graphs
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
James A. Davis, Qing Xiang