Sciweavers

1712 search results - page 112 / 343
» A Computational Approach to Binding Theory
Sort
View
FOCS
2005
IEEE
15 years 7 months ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
PLPV
2009
ACM
15 years 10 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
98
Voted
EDBT
2010
ACM
147views Database» more  EDBT 2010»
15 years 8 months ago
A simple (yet powerful) algebra for pervasive environments
Querying non-conventional data is recognized as a major issue in new environments and applications such as those occurring in pervasive computing. A key issue is the ability to qu...
Yann Gripay, Frédérique Laforest, Je...
IEEESCC
2008
IEEE
15 years 8 months ago
A 3-level e-Business Registry Meta Model
Business partners willing to do business electronically with each other must reach an agreement (1) on the economic level, (2) on the inter-organizational process choreography, an...
Christian Huemer, Philipp Liegl, Rainer Schuster, ...
ADHOCNOW
2005
Springer
15 years 7 months ago
Enhancing the Security of On-demand Routing in Ad Hoc Networks
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
Zhenjiang Li, J. J. Garcia-Luna-Aceves