Sciweavers

194 search results - page 19 / 39
» A cost semantics for self-adjusting computation
Sort
View
PLDI
2010
ACM
14 years 22 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
ICDCS
2005
IEEE
14 years 1 months ago
Similarity Searching in Peer-to-Peer Databases
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
BIRTHDAY
2003
Springer
14 years 27 days ago
A Formal Basis for Reasoning on Programmable QoS
Abstract. The explicit management of Quality of Service (QoS) of network connectivity, such as, e.g., working cost, transaction support, and security, is a key requirement for the ...
Rocco De Nicola, Gian Luigi Ferrari, Ugo Montanari...