Sciweavers

447 search results - page 71 / 90
» Decision trees with minimal costs
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 2 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
MOBIHOC
2005
ACM
14 years 8 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
SPAA
2010
ACM
14 years 1 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
ICALP
2010
Springer
14 years 1 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
PPOPP
2010
ACM
14 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...