1404 search results - page 269 / 281 » Complexity of admissible rules |
142
click to vote
CICLING
2010
Springer
15 years 11 months ago
2010
Springer
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...
174
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
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 ...
176
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
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...
168
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
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...
221
click to vote
SIGMETRICS
2010
ACM
15 years 10 months ago
2010
ACM
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...