Sciweavers

21 search results - page 1 / 5
» Polynomial-time approximation scheme for data broadcast
Sort
View
STOC
2000
ACM
122views Algorithms» more  STOC 2000»
13 years 9 months ago
Polynomial-time approximation scheme for data broadcast
Claire Kenyon, Nicolas Schabanel, Neal E. Young
INFOCOM
2009
IEEE
13 years 12 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 5 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
CG
2002
Springer
13 years 5 months ago
Towards robust broadcasting of geometry data
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
Stephan Bischoff, Leif Kobbelt
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
13 years 10 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...