653 search results - page 67 / 131 » Factored Planning: How, When, and When Not |
181
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
279
click to vote
GCC
2007
Springer
16 years 15 days ago
2007
Springer
Data service is the principle application in structured P2P networks. And in many cases, we need the data to persist for a long time. So how to persist the data service and how lo...
138
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
144
click to vote
DSS
2006
15 years 6 months ago
2006
The increasing proliferation of online shopping and purchasing has naturally led to a growth in the popularity of comparisonshopping search engines, popularly known as "shopb...
189
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...