Sciweavers

3359 search results - page 437 / 672
» A Simplified Idea Algorithm
Sort
View
NIPS
2007
15 years 1 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
120
Voted
BMCBI
2010
108views more  BMCBI 2010»
15 years 18 days ago
A genetic ensemble approach for gene-gene interaction identification
Background: It has now become clear that gene-gene interactions and gene-environment interactions are ubiquitous and fundamental mechanisms for the development of complex diseases...
Pengyi Yang, Joshua W. K. Ho, Albert Y. Zomaya, Bi...
106
Voted
PAMI
2008
152views more  PAMI 2008»
15 years 13 days ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
146
Voted
ICALP
2009
Springer
16 years 23 days ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
221
Voted
POPL
2003
ACM
16 years 24 days ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula