4114 search results - page 417 / 823 » Efficient Algorithms for the 2-Center Problems |
270
click to vote
AAAI
2010
15 years 8 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
280
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
169
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
A multiclass classification problem can be reduced to a collection of binary problems with the aid of a coding matrix. The quality of the final solution, which is an ensemble of b...
189
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
164
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...