113 search results - page 8 / 23 » Simpler is also better in approximating fixed points |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
AIPS
2007
13 years 11 months ago
2007
We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
TNN
2010
13 years 3 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Legged robots require accurate models of their environment in order to plan and execute paths. We present a probabilistic technique based on Gaussian processes that allows terr...