Sciweavers

13603 search results - page 2608 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
SEMCO
2009
IEEE
15 years 4 months ago
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
Bob Coyne, Owen Rambow
APNOMS
2009
Springer
15 years 4 months ago
A Scheme for Supporting Optimal Path in 6LoWPAN Based MANEMO Networks
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...
Jin Ho Kim, Choong Seon Hong
CIVR
2009
Springer
192views Image Analysis» more  CIVR 2009»
15 years 4 months ago
Example based video filters
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 ...
Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C....
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 4 months ago
Improved Approximation of Linear Threshold Functions
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...
Ilias Diakonikolas, Rocco A. Servedio
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—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...
Ronen Shaltiel
« Prev « First page 2608 / 2721 Last » Next »