Sciweavers

1136 search results - page 145 / 228
» Finding Small Holes
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Unsupervised Risk Stratification in Clinical Datasets: Identifying Patients at Risk of Rare Outcomes
Most existing algorithms for clinical risk stratification rely on labeled training data. Collecting this data is challenging for clinical conditions where only a small percentage ...
Zeeshan Syed, Ilan Rubinfeld
DEXA
2010
Springer
319views Database» more  DEXA 2010»
13 years 9 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
CVPR
2008
IEEE
13 years 9 months ago
Joint learning and dictionary construction for pattern recognition
We propose a joint representation and classification framework that achieves the dual goal of finding the most discriminative sparse overcomplete encoding and optimal classifier p...
Duc-Son Pham, Svetha Venkatesh
AIEDAM
2007
90views more  AIEDAM 2007»
13 years 9 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
ALGORITHMICA
2010
188views more  ALGORITHMICA 2010»
13 years 9 months ago
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
Katerina Asdre, Stavros D. Nikolopoulos