Sciweavers

1511 search results - page 110 / 303
» Randomness, lowness and degrees
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
Embeddings of surfaces, curves, and moving points in euclidean space
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
CVPR
2007
IEEE
16 years 8 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...
WIOPT
2005
IEEE
15 years 12 months ago
Analysis of a Distributed Algorithm to Determine Multiple Routes with Path Diversity in Ad Hoc Networks
With multipath routing in mobile ad hoc networks (MANETs), a source can establish multiple routes to a destination for routing data. In MANETs, mulitpath routing can be used to pr...
Stephen Mueller, Dipak Ghosal
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 10 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
EURONGI
2008
Springer
15 years 8 months ago
Location Management Based on the Mobility Patterns of Mobile Users
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
Ignacio Martinez-Arrue, Pablo García-Escall...