Sciweavers

620 search results - page 102 / 124
» About the logical relations between cases and rules
Sort
View
POPL
2007
ACM
16 years 1 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
JISBD
2000
15 years 2 months ago
Databases and Natural Language Interfaces
A Natural Language Interface for Databases allows users of multimedia kiosks to formulate natural language questions. User questions are first translated into a logic language and ...
Porfírio P. Filipe, Nuno J. Mamede
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
15 years 6 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 1 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
RSA
2011
124views more  RSA 2011»
14 years 8 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...