Sciweavers

244 search results - page 31 / 49
» Geometric Data Structures on a Reconfigurable Mesh, with App...
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 3 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
SIGGRAPH
2010
ACM
15 years 2 months ago
Star-contours for efficient hierarchical self-collision detection
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...
ECCV
2004
Springer
15 years 3 months ago
AQUATICS Reconstruction Software: The Design of a Diagnostic Tool Based on Computer Vision Algorithms
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
Andrea Giachetti, Gianluigi Zanetti
BMCBI
2007
115views more  BMCBI 2007»
14 years 10 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
VLDB
2007
ACM
124views Database» more  VLDB 2007»
15 years 4 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...