Sciweavers

247 search results - page 6 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
ICAD
2004
13 years 9 months ago
Selective and Divided Attention: Extracting Information from Simultaneous Sound Sources
The way in which sounds interact and interfere with each other (both acoustically and perceptually) has an important influence on how well an auditory display can convey informati...
Barbara G. Shinn-Cunningham, Antje Ihlefeld
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
COR
2007
86views more  COR 2007»
13 years 7 months ago
Sourcing with random yields and stochastic demand: A newsvendor approach
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
Shitao Yang, Jian Yang, Layek Abdel-Malek
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
13 years 11 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
GIS
2005
ACM
14 years 8 months ago
Automatic extraction of road intersections from raster maps
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
Yao-Yi Chiang, Craig A. Knoblock, Ching-Chien Chen