2778 search results - page 470 / 556 » Limit complexities revisited |
185
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
170
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
181
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
273
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
206
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...