Sciweavers

2905 search results - page 210 / 581
» Formal Memetic Algorithms
Sort
View
JCB
2008
170views more  JCB 2008»
13 years 10 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han
AAAI
2011
12 years 10 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
ECCV
2008
Springer
15 years 19 days ago
Edge-Preserving Smoothing and Mean-Shift Segmentation of Video Streams
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
Sylvain Paris
EACL
2009
ACL Anthology
14 years 11 months ago
Parsing Mildly Non-Projective Dependency Structures
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Carlos Gómez-Rodríguez, David J. Wei...
SOFSEM
2009
Springer
14 years 7 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...