Sciweavers

1024 search results - page 96 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
NIPS
2007
14 years 11 months ago
The discriminant center-surround hypothesis for bottom-up saliency
The classical hypothesis, that bottom-up saliency is a center-surround process, is combined with a more recent hypothesis that all saliency decisions are optimal in a decision-the...
Dashan Gao, Vijay Mahadevan, Nuno Vasconcelos
BMCBI
2005
109views more  BMCBI 2005»
14 years 9 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
CIKM
2009
Springer
15 years 1 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
KDD
2010
ACM
310views Data Mining» more  KDD 2010»
15 years 1 months ago
An integrated machine learning approach to stroke prediction
Stroke is the third leading cause of death and the principal cause of serious long-term disability in the United States. Accurate prediction of stroke is highly valuable for early...
Aditya Khosla, Yu Cao, Cliff Chiung-Yu Lin, Hsu-Ku...
JFP
2006
78views more  JFP 2006»
14 years 10 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester