Sciweavers

418 search results - page 11 / 84
» Many Happy Returns
Sort
View
ECML
2007
Springer
14 years 27 days ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
ENTER
2006
Springer
13 years 10 months ago
From Information Behaviour of Independent Travellers to Requirements for Information Systems
The complexity and dynamic nature of travelling offers many opportunities for technological support. But printed guidebooks remain the typical companion, despite many weaknesses. ...
Marco Prestipino
AAAI
2010
13 years 8 months ago
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
COLOGNETWENTE
2007
13 years 8 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
PPOPP
2012
ACM
12 years 2 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...