Sciweavers

4480 search results - page 853 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
NSDI
2004
13 years 10 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
TCS
2002
13 years 8 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...
GRAPHICSINTERFACE
2011
13 years 16 days ago
Ubiquitous cursor: a comparison of direct and indirect pointing feedback in multi-display environments
Multi-display environments (MDEs) connect several displays into a single digital workspace. One of the main problems to be solved in an MDE’s design is how to enable movement of...
Robert Xiao, Miguel A. Nacenta, Regan L. Mandryk, ...
ESOP
2005
Springer
14 years 2 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 1 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi