Sciweavers

191 search results - page 16 / 39
» Adding Weight to DL-Lite
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 1 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
AND
2009
14 years 7 months ago
Digital weight watching: reconstruction of scanned documents
A web-portal providing access to over 250.000 scanned and OCRed cultural heritage documents is analyzed. The collection consists of the complete Dutch Hansard from 1917 to 1995. E...
Tim Gielissen, Maarten Marx
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 10 days ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
MOBIHOC
2007
ACM
15 years 9 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...