Sciweavers

2496 search results - page 260 / 500
» On covering by translates of a set
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 6 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
HPCA
2011
IEEE
14 years 10 months ago
Archipelago: A polymorphic cache design for enabling robust near-threshold operation
Extreme technology integration in the sub-micron regime comes with a rapid rise in heat dissipation and power density for modern processors. Dynamic voltage scaling is a widely us...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...
CVPR
2007
IEEE
16 years 8 months ago
Accurate, Dense, and Robust Multi-View Stereopsis
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
Yasutaka Furukawa, Jean Ponce
MICCAI
2009
Springer
16 years 7 months ago
Constructing a Dictionary of Human Brain Folding Patterns
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...
Zhong Yi Sun, Matthieu Perrot, Alan Tucholka, Deni...
ICML
1998
IEEE
16 years 7 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour