Sciweavers

1027 search results - page 183 / 206
» Ordered Vertex Partitioning
Sort
View
KAIS
2006
247views more  KAIS 2006»
13 years 7 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
FMSD
2007
110views more  FMSD 2007»
13 years 7 months ago
Exploiting interleaving semantics in symbolic state-space generation
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
Gianfranco Ciardo, Gerald Lüttgen, Andrew S. ...
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
BMCBI
2011
13 years 2 months ago
PICS-Ord: Unlimited Coding of Ambiguous Regions by Pairwise Identity and Cost Scores Ordination
Background: We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by ‘Pairwise Identity and Cost Scores Ordination’ (PICS-Ord)....
Robert K. Luecking, Brendan P. Hodkinson, Alexandr...
ICALP
2011
Springer
12 years 11 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...