Sciweavers

667 search results - page 113 / 134
» Total parser combinators
Sort
View
WWW
2007
ACM
14 years 9 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
POPL
2009
ACM
14 years 9 months ago
SPEED: precise and efficient static estimation of program computational complexity
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...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
CHI
2001
ACM
14 years 9 months ago
Chinese input with keyboard and eye-tracking: an anatomical study
Chinese input presents unique challenges to the field of human computer interaction. This study provides an anatomical analysis of today's standard Chinese input process, whi...
Jingtao Wang, Shumin Zhai, Hui Su
POPL
2004
ACM
14 years 9 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
SIGMOD
2005
ACM
106views Database» more  SIGMOD 2005»
14 years 9 months ago
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...
Amit Manjhi, Suman Nath, Phillip B. Gibbons