779 search results - page 104 / 156 » Determining Time of Queries for Re-ranking Search Results |
186
click to vote
COMAD
2008
15 years 7 months ago
2008
Huge amount of information is present in the World Wide Web and a large amount is being added to it frequently. A query-specific summary of multiple documents is very helpful to t...
144
click to vote
DAC
1998
ACM
16 years 7 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
166
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
174
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
157
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably lo...