2089 search results - page 270 / 418 » A New Problem in String Searching |
174
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...
JCM
2007
14 years 10 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
SIGIR
2008
ACM
14 years 10 months ago
2008
ACM
Relevance feedback, which traditionally uses the terms in the relevant documents to enrich the user's initial query, is an effective method for improving retrieval performanc...
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...