8437 search results - page 1612 / 1688 » Preferences over Sets |
180
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
158
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and imp...
171
click to vote
IIS
2003
15 years 7 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
144
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
165
click to vote
OPODIS
2003
15 years 7 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...