Sciweavers

1368 search results - page 101 / 274
» The Implicit Pipeline Method
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney
ICRA
2008
IEEE
160views Robotics» more  ICRA 2008»
14 years 4 months ago
No robot left behind: Coordination to overcome local minima in swarm navigation
Abstract— In this paper, we address navigation and coordination methods that allow swarms of robots to converge and spread along complex 2D shapes in environments containing unkn...
Leandro Soriano Marcolino, Luiz Chaimowicz
PG
2007
IEEE
14 years 4 months ago
A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
Julien Wintz, Bernard Mourrain
ECAI
2006
Springer
14 years 1 months ago
Learning by Automatic Option Discovery from Conditionally Terminating Sequences
Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learn...
Sertan Girgin, Faruk Polat, Reda Alhajj
DAC
2002
ACM
14 years 11 months ago
A fast on-chip profiler memory
Profiling an application executing on a microprocessor is part of the solution to numerous software and hardware optimization and design automation problems. Most current profilin...
Roman L. Lysecky, Susan Cotterell, Frank Vahid