2526 search results - page 257 / 506 » A New Algorithm for Answer Set Computation |
145
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
287
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
174
click to vote
ESA
2007
Springer
16 years 23 days ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
162
click to vote
SSDBM
2006
IEEE
16 years 18 days ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
227
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...