Sciweavers

4759 search results - page 665 / 952
» Parallelizing the Phylogeny Problem
Sort
View
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 5 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
CORR
2011
Springer
149views Education» more  CORR 2011»
15 years 1 months ago
Load-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
Erik Saule, Erdeniz Ö. Bas, Ümit V. &Cce...
SIGIR
2011
ACM
14 years 9 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin
CEC
2011
IEEE
14 years 6 months ago
Effective ranking + speciation = Many-objective optimization
—Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (th...
Mario Garza-Fabre, Gregorio Toscano Pulido, Carlos...
EMNLP
2011
14 years 6 months ago
Universal Morphological Analysis using Structured Nearest Neighbor Prediction
In this paper, we consider the problem of unsupervised morphological analysis from a new angle. Past work has endeavored to design unsupervised learning methods which explicitly o...
Young-Bum Kim, João Graça, Benjamin ...