143 search results - page 11 / 29 » How to rank with few errors |
103
click to vote
WWW
2009
ACM
16 years 11 days ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
120
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
141
click to vote
ISPW
2011
IEEE
14 years 3 months ago
2011
IEEE
Software process models are sophisticated and large specifications aimed at organizing and managing software development. Their formal specification demands an enormous effort,...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...