6833 search results - page 392 / 1367 » Some two-character sets |
166
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
199
click to vote
ORDER
2010
15 years 5 months ago
2010
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented ...
186
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
175
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper proposes a framework dedicated to the construction of what we call time elastic inner products allowing one to embed sets of non-uniformly sampled multivariate time ser...
233
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...