Sciweavers

2465 search results - page 493 / 493
» Automata on Linear Orderings
Sort
View
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 5 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
EMMCVPR
2011
Springer
12 years 5 months ago
Data-Driven Importance Distributions for Articulated Tracking
Abstract. We present two data-driven importance distributions for particle filterbased articulated tracking; one based on background subtraction, another on depth information. In ...
Søren Hauberg, Kim Steenstrup Pedersen
SASN
2004
ACM
13 years 10 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
DIMACS
1996
13 years 6 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin