Sciweavers

860 search results - page 156 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
TMI
2010
172views more  TMI 2010»
13 years 6 months ago
Comparison of AdaBoost and Support Vector Machines for Detecting Alzheimer's Disease Through Automated Hippocampal Segmentation
Abstract— We compared four automated methods for hippocampal segmentation using different machine learning algorithms (1) hierarchical AdaBoost, (2) Support Vector Machines (SVM)...
Jonathan H. Morra, Zhuowen Tu, Liana G. Apostolova...
CVPR
2009
IEEE
15 years 2 months ago
Projective Least-Squares: Global Solutions with Local Optimization
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efciency. On the other hand, traditional bundle adj...
Carl Olsson, Fredrik Kahl, Richard I. Hartley
CN
2007
116views more  CN 2007»
13 years 7 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
CGO
2004
IEEE
13 years 11 months ago
VHC: Quickly Building an Optimizer for Complex Embedded Architectures
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
Michael Dupré, Nathalie Drach, Olivier Tema...