60 search results - page 5 / 12 » The Structure and Number of Global Roundings of a Graph |
AAAI
1996
13 years 8 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
BIOINFORMATICS
2011
13 years 2 months ago
2011
Motivation: High-throughput methods for detecting molecular interactions have produced large sets of biological network data with much more yet to come. Analogous to sequence alig...
JEI
2006
13 years 7 months ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
SIAMCOMP
2010
13 years 5 months ago
2010
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...