Sciweavers

1497 search results - page 40 / 300
» Constraint Databases: A Survey
Sort
View
ARC
2008
Springer
95views Hardware» more  ARC 2008»
13 years 11 months ago
The Instruction-Set Extension Problem: A Survey
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...
Carlo Galuzzi, Koen Bertels
WOLLIC
2009
Springer
14 years 4 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
14 years 1 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
BMCBI
2008
104views more  BMCBI 2008»
13 years 10 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
KAIS
2008
150views more  KAIS 2008»
13 years 9 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng