Sciweavers

19003 search results - page 285 / 3801
» We Need Assurance
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
COCOON
2009
Springer
16 years 1 months ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...
INFOCOM
2006
IEEE
16 years 22 days ago
Routers with Very Small Buffers
Abstract— Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory ...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
EOR
2007
93views more  EOR 2007»
15 years 6 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...
ICDE
2008
IEEE
425views Database» more  ICDE 2008»
17 years 6 months ago
NAGA: Searching and Ranking Knowledge
The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracte...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...