34170 search results - page 6379 / 6834 » Optimization |
155
click to vote
CCS
2007
ACM
16 years 11 days ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
186
click to vote
CIE
2007
Springer
16 years 11 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
151
click to vote
CIE
2007
Springer
16 years 11 days ago
2007
Springer
Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a fe...
156
click to vote
CIKM
2007
Springer
16 years 11 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
159
click to vote
CIKM
2007
Springer
16 years 11 days ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...