Sciweavers

16518 search results - page 3134 / 3304
» A New Approach to Splitting-Off
Sort
View
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
16 years 1 months ago
Lion and man game in the presence of a circular obstacle
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
Nikhil Karnad, Volkan Isler
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ATAL
2009
Springer
16 years 1 months ago
Distributed constraint optimization with structured resource constraints
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...
Akshat Kumar, Boi Faltings, Adrian Petcu
CIKM
2009
Springer
16 years 1 months ago
The impact of document structure on keyphrase extraction
Keyphrases are short phrases that reflect the main topic of a document. Because manually annotating documents with keyphrases is a time-consuming process, several automatic appro...
Katja Hofmann, Manos Tsagkias, Edgar Meij, Maarten...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 1 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 3134 / 3304 Last » Next »