Sciweavers

1092 search results - page 68 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 3 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
MOBIHOC
2008
ACM
16 years 5 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
MOC
2002
135views more  MOC 2002»
15 years 5 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
WWW
2009
ACM
16 years 6 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 8 months ago
Monitoring Atomicity in Concurrent Programs
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
Azadeh Farzan, P. Madhusudan