501 search results - page 59 / 101 » Rough Sets and Approximation Schemes |
121
click to vote
SIAMCOMP
2008
15 years 19 days ago
2008
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...
129
Voted
DCC
2011
IEEE
14 years 7 months ago
2011
IEEE
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...
111
click to vote
SIGMOD
2004
ACM
16 years 26 days ago
2004
ACM
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...
119
click to vote
CORR
2008
Springer
15 years 24 days ago
2008
Springer
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...
121
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
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...