Sciweavers

81 search results - page 10 / 17
» A Fast Random Sampling Algorithm for Sparsifying Matrices
Sort
View
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
AAAI
2007
13 years 10 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
CRV
2011
IEEE
278views Robotics» more  CRV 2011»
12 years 7 months ago
Online Visual Vocabularies
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
Yogesh A. Girdhar, Gregory Dudek
AEI
1999
120views more  AEI 1999»
13 years 7 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
ICML
2008
IEEE
14 years 8 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash