Sciweavers

1083 search results - page 104 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
SSDBM
1998
IEEE
107views Database» more  SSDBM 1998»
15 years 10 months ago
Discrete Object Detection and Motion Registration Based on a Data Management Approach
When scientific data sets can be interpreted visually they are typically managed as pictures and consequently stored as large collections of bitmaps. Valuable information containe...
Hans Hinterberger, Bettina Bauer-Messmer
ISBI
2008
IEEE
16 years 7 months ago
Sift-based sequence registration and flow-based cortical vessel segmentation applied to high resolution optical imaging data
Several functional and biomedical imaging techniques rely on determining hemodynamic variables and their changes in large vascular networks. To do so at micro-vascular resolution ...
Ivo Vanzetta, Mickaël Péchaud, Renaud ...
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
EMNLP
2010
15 years 4 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple