Sciweavers

1366 search results - page 107 / 274
» Modularizing Contexted Constraints
Sort
View
EDBT
2009
ACM
124views Database» more  EDBT 2009»
15 years 6 months ago
A sequential indexing scheme for flash-based embedded systems
NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such ...
Shaoyi Yin, Philippe Pucheral, Xiaofeng Meng
ICALP
2005
Springer
15 years 4 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 3 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
AMW
2010
15 years 23 days ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
VMCAI
2010
Springer
15 years 8 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri