Sciweavers

1387 search results - page 180 / 278
» Convexity in Discrete Space
Sort
View
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
16 years 3 months 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 3 months 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

Publication
222views
16 years 3 months 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»
16 years 1 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,...
SECON
2007
IEEE
16 years 21 days ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou