4112 search results - page 397 / 823 » Efficient Algorithms for the Spoonerism Problem |
191
Voted
ICML
2006
IEEE
16 years 8 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...
311
click to vote
POPL
2007
ACM
16 years 8 months ago
2007
ACM
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
211
click to vote
RECOMB
2005
Springer
16 years 8 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...
202
click to vote
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
175
click to vote
ESA
2008
Springer
15 years 9 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...