Sciweavers

1404 search results - page 269 / 281
» Complexity of admissible rules
Sort
View
CICLING
2010
Springer
14 years 1 months ago
Extraction of Genic Interactions with the Recursive Logical Theory of an Ontology
We introduce an Information Extraction (IE) system which uses the logical theory of an ontology as a generalisation of the typical information extraction patterns to extract biolog...
Alain-Pierre Manine, Érick Alphonse, Philip...
FOCS
2002
IEEE
14 years 1 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ICDT
2010
ACM
205views Database» more  ICDT 2010»
14 years 1 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...