Sciweavers

4850 search results - page 183 / 970
» Approximate Data Structures with Applications
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
131
Voted
MICCAI
2005
Springer
16 years 7 months ago
Bone Enhancement Filtering: Application to Sinus Bone Segmentation and Simulation of Pituitary Surgery
We present a novel multi-scale bone enhancement measure that can be used to drive a geometric flow to segment bone structures. This measure has the essential properties to be incor...
Maxime Descoteaux, Michel A. Audette, Kiyoyuki Chi...
CONSTRAINTS
2008
182views more  CONSTRAINTS 2008»
15 years 7 months ago
Constraint Programming in Structural Bioinformatics
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
Pedro Barahona, Ludwig Krippahl
CHI
2005
ACM
16 years 7 months ago
QueryLines: approximate query for visual browsing
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by d...
Kathy Ryall, Neal Lesh, Tom Lanning, Darren Leigh,...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 10 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan