Sciweavers

127 search results - page 7 / 26
» Locally Thin Set Families
Sort
View
BMCBI
2007
115views more  BMCBI 2007»
14 years 11 months ago
Local comparison of protein structures highlights cases of convergent evolution in analogous functional sites
Background: We performed an exhaustive search for local structural similarities in an ensemble of non-redundant protein functional sites. With the purpose of finding new examples ...
Gabriele Ausiello, Daniele Peluso, Allegra Via, Ma...
114
Voted
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 10 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
93
Voted
CVPR
2007
IEEE
16 years 1 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
CP
2010
Springer
14 years 10 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
ECCC
2010
131views more  ECCC 2010»
14 years 12 months ago
High-rate codes with sublinear-time decoding
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin