Sciweavers

380 search results - page 57 / 76
» A Categorical Setting for Lower Complexity
Sort
View
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
69
Voted
DATE
2007
IEEE
138views Hardware» more  DATE 2007»
15 years 4 months ago
Low-overhead circuit synthesis for temperature adaptation using dynamic voltage scheduling
—Increasing power density causes die overheating due to limited cooling capacity of the package. Conventional thermal management techniques e.g. logic shutdown, clock gating, fre...
Swaroop Ghosh, Swarup Bhunia, Kaushik Roy
86
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
Tarem Ahmed, Mark Coates, Anukool Lakhina
65
Voted
ATAL
2007
Springer
15 years 3 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
COMPGEOM
2004
ACM
15 years 3 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...