Sciweavers

286 search results - page 24 / 58
» Lossless Regular Views
Sort
View
LPAR
2010
Springer
13 years 8 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
CIKM
2004
Springer
14 years 3 months ago
Extending and inferring functional dependencies in schema transformation
We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schemat...
Qi He, Tok Wang Ling
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 3 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
INFOCOM
2012
IEEE
12 years 9 days ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri