Sciweavers

1351 search results - page 55 / 271
» New Research Directions in Search Results Clustering
Sort
View
RECOMB
2002
Springer
15 years 10 months ago
A new approach to analyzing gene expression time series data
We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved timepoints, clustering, and dataset alignment. Each expression p...
Ziv Bar-Joseph, Georg Gerber, David K. Gifford, To...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
14 years 11 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
GMP
2006
IEEE
127views Solid Modeling» more  GMP 2006»
15 years 3 months ago
Finding All Undercut-Free Parting Directions for Extrusions
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
Xiaorui Chen, Sara McMains
COLOGNETWENTE
2010
14 years 6 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
SIGIR
2008
ACM
14 years 9 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma