Sciweavers

1716 search results - page 248 / 344
» Proving Conditional Termination
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
15 years 7 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
CVPR
2006
IEEE
15 years 7 months ago
Blind Haze Separation
Outdoor imaging is plagued by poor visibility conditions due to atmospheric scattering, particularly in haze. A major problem is spatially-varying reduction of contrast by stray r...
Sarit Shwartz, Einav Namer, Yoav Y. Schechner
ATAL
2010
Springer
15 years 5 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer
BMCBI
2008
138views more  BMCBI 2008»
15 years 3 months ago
Combining transcriptional datasets using the generalized singular value decomposition
Background: Both microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies...
Andreas W. Schreiber, Neil J. Shirley, Rachel A. B...
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran