Sciweavers

5263 search results - page 670 / 1053
» Open Constraint Optimization
Sort
View
200
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
227
Voted
ISBRA
2009
Springer
16 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
215
Voted
IPPS
2009
IEEE
16 years 1 months ago
Annotation-based empirical performance tuning using Orio
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...
Albert Hartono, Boyana Norris, Ponnuswamy Sadayapp...
SECON
2008
IEEE
16 years 1 months ago
UDAE: Universal Data Access Engine for Sensor Networks
—We present the design and implementation of UDAE, a Universal Data Access Engine for wireless sensor networks. The UDAE allows developers to access data both locally and over th...
Krisakorn Rerkrai, Janne Riihijärvi, Petri M&...
243
Voted
CPAIOR
2007
Springer
16 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker