Sciweavers

101 search results - page 19 / 21
» On completely nonmeasurable unions
Sort
View
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
14 years 13 days ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
ESSLLI
1999
Springer
13 years 12 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
CCS
2008
ACM
13 years 9 months ago
Towards an efficient and language-agnostic compliance checker for trust negotiation systems
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...
Adam J. Lee, Marianne Winslett
CHI
2005
ACM
13 years 9 months ago
Urban probes: encountering our emerging urban atmospheres
Urban Atmospheres captures a unique, synergistic moment – expanding urban populations, rapid adoption of Bluetooth mobile devices, tiny ad hoc sensor networks, and the widesprea...
Eric Paulos, Tom Jenkins
KDID
2004
140views Database» more  KDID 2004»
13 years 9 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...