Sciweavers

217 search results - page 19 / 44
» On the Fine Structure of Large Search Spaces
Sort
View
ICCV
2007
IEEE
15 years 6 months ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...
FOCS
2006
IEEE
15 years 5 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
ER
2005
Springer
200views Database» more  ER 2005»
15 years 5 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
110
Voted
AMEC
2003
Springer
15 years 5 months ago
Improving Learning Performance by Applying Economic Knowledge
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...
Christopher H. Brooks, Robert S. Gazzale, Jeffrey ...
BMCBI
2007
148views more  BMCBI 2007»
14 years 11 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...