Sciweavers

49 search results - page 6 / 10
» Learning DNF from Random Walks
Sort
View
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
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
COLT
2008
Springer
13 years 9 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
JSS
2010
198views more  JSS 2010»
13 years 2 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
IJRR
2011
226views more  IJRR 2011»
13 years 2 months ago
Place-dependent people tracking
Abstract People typically move and act under the constraints of an environment, making human behavior strongly place-dependent. Motion patterns, the places and the rates at which p...
Matthias Luber, Gian Diego Tipaldi, Kai Oliver Arr...