3192 search results - page 326 / 639 » The minimum latency problem |
177
Voted
HSNMC
2003
Springer
15 years 10 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
141
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
156
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
162
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
137
click to vote
CAIP
2001
Springer
15 years 9 months ago
2001
Springer
This paper describes a technique for text segmentation of machine printed Gurmukhi script documents. Research in the field of segmentation of Gurmukhi script faces major problems m...