6274 search results - page 28 / 1255 » From query complexity to computational complexity |
238
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
130
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
101
click to vote
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
119
Voted
IJFCS
2006
15 years 2 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
122
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...