Sciweavers

552 search results - page 102 / 111
» Lower bounds for dynamic connectivity
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 8 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin
CORR
2006
Springer
129views Education» more  CORR 2006»
13 years 7 months ago
On the Optimality of the ARQ-DDF Protocol
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
Kambiz Azarian, Hesham El Gamal, Philip Schniter
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 5 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
SOCO
2010
Springer
13 years 2 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...