Sciweavers

475 search results - page 54 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
VLDB
2007
ACM
122views Database» more  VLDB 2007»
14 years 7 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
SDM
2010
SIAM
166views Data Mining» more  SDM 2010»
13 years 9 months ago
A Permutation Approach to Validation
We give a permutation approach to validation (estimation of out-sample error). One typical use of validation is model selection. We establish the legitimacy of the proposed permut...
Malik Magdon-Ismail, Konstantin Mertsalov
ICML
2009
IEEE
14 years 8 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy