Sciweavers

121 search results - page 16 / 25
» Improving branch-and-cut performance by random sampling
Sort
View
RECOMB
2007
Springer
16 years 6 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
ASPDAC
2006
ACM
118views Hardware» more  ASPDAC 2006»
15 years 12 months ago
A probabilistic analysis of pipelined global interconnect under process variations
— The main thesis of this paper is to perform a reliability based performance analysis for a shared latch inserted global interconnect under uncertainty. We first put forward a ...
Navneeth Kankani, Vineet Agarwal, Janet Meiling Wa...
ML
2007
ACM
156views Machine Learning» more  ML 2007»
15 years 5 months ago
Active learning for logistic regression: an evaluation
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
Andrew I. Schein, Lyle H. Ungar
ICDAR
2003
IEEE
15 years 11 months ago
Investigation of Off-Line Japanese Signature Verification Using a Pattern Matching
This paper deals with an off-line Japanese signature verification using a pattern matching method. An annoying problem encountered in off-line signature verification using a patte...
Katsuhiko Ueda
ICASSP
2008
IEEE
16 years 13 days ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...