Sciweavers

501 search results - page 59 / 101
» Rough Sets and Approximation Schemes
Sort
View
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 6 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
DCC
2011
IEEE
15 years 1 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 6 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 6 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
CVPR
2004
IEEE
16 years 8 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden