Sciweavers

1604 search results - page 181 / 321
» Regularization on Discrete Spaces
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 3 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
114
Voted
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
16 years 24 days ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 24 days ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
148
Voted

Publication
222views
16 years 12 days ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
TEI
2009
ACM
173views Hardware» more  TEI 2009»
15 years 10 months ago
xtel: a development environment to support rapid prototyping of "ubiquitous content"
This paper describes the "xtel" development environment for "Ubiquitous Content". Ubiquitous contents are real space applications that are embedded in day-to-d...
Satoru Tokuhisa, Takaaki Ishizawa, Yoshimasa Niwa,...