16666 search results - page 3093 / 3334 » Descriptive and Computational Complexity |
192
click to vote
APNOMS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
205
click to vote
CIVR
2009
Springer
16 years 1 months ago
2009
Springer
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
171
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
217
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
175
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...