Sciweavers

2489 search results - page 371 / 498
» On the Subgroup Distance Problem
Sort
View
134
Voted
IMC
2007
ACM
15 years 5 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
112
Voted
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
15 years 5 months ago
Lattice based Clustering of Temporal Gene-Expression Matrices
Individuals show different cell classes when they are in the different stages of a disease, have different disease subtypes, or have different response to a treatment or envir...
Yang Huang, Martin Farach-Colton
154
Voted
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 5 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
140
Voted
BMCBI
2007
147views more  BMCBI 2007»
15 years 3 months ago
Hon-yaku: a biology-driven Bayesian methodology for identifying translation initiation sites in prokaryotes
Background: Computational prediction methods are currently used to identify genes in prokaryote genomes. However, identification of the correct translation initiation sites remain...
Yuko Makita, Michiel J. L. de Hoon, Antoine Danchi...
150
Voted
CGF
2008
201views more  CGF 2008»
15 years 3 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt