Sciweavers

1083 search results - page 124 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
VMV
2001
132views Visualization» more  VMV 2001»
15 years 7 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
BMCBI
2010
86views more  BMCBI 2010»
15 years 6 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
15 years 4 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
KDD
2007
ACM
189views Data Mining» more  KDD 2007»
16 years 6 months ago
Corroborate and learn facts from the web
The web contains lots of interesting factual information about entities, such as celebrities, movies or products. This paper describes a robust bootstrapping approach to corrobora...
Shubin Zhao, Jonathan Betz
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 7 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount