Sciweavers

4526 search results - page 209 / 906
» Algorithmic problems related to the Internet
Sort
View
DRR
2003
15 years 6 months ago
Document structure analysis algorithms: a literature survey
Document structure analysis can be regarded as a syntactic analysis problem. The order and containment relations among the physical or logical components of a document page can be...
Song Mao, Azriel Rosenfeld, Tapas Kanungo
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 4 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 4 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
CIDR
2011
253views Algorithms» more  CIDR 2011»
14 years 8 months ago
Answering Queries using Humans, Algorithms and Databases
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
Aditya G. Parameswaran, Neoklis Polyzotis
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 9 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye