Sciweavers

10995 search results - page 279 / 2199
» Positioning
Sort
View
WADS
2005
Springer
145views Algorithms» more  WADS 2005»
16 years 21 days ago
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
Victor Chepoi, Bertrand Estellon, Yann Vaxè...
COMPGEOM
2004
ACM
16 years 20 days ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
177
Voted
CLEF
2004
Springer
16 years 19 days ago
How Do Named Entities Contribute to Retrieval Effectiveness?
Named entities in topics are a major factor contributing to the quality of retrieval results. In this paper, we report on an analysis on the correlation between the number of named...
Thomas Mandl, Christa Womser-Hacker
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
16 years 18 days ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
FOSSACS
2004
Springer
16 years 18 days ago
Perfect-Information Stochastic Parity Games
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
Wieslaw Zielonka