Sciweavers

227 search results - page 35 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
14 years 10 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
15 years 2 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
ICDCS
2008
IEEE
15 years 3 months ago
Weak vs. Self vs. Probabilistic Stabilization
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...
Stéphane Devismes, Sébastien Tixeuil...
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
DCOSS
2011
Springer
13 years 9 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun