Sciweavers

4066 search results - page 96 / 814
» Almost Complete Sets
Sort
View
ICDE
1994
IEEE
103views Database» more  ICDE 1994»
15 years 10 months ago
A Multi-Set Extended Relational Algebra - A Formal Approach to a Practical Issue
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
Paul W. P. J. Grefen, Rolf A. de By
CIKM
2006
Springer
15 years 10 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li
ENTCS
2010
118views more  ENTCS 2010»
15 years 3 months ago
Systematic Refinement of Performance Models for Concurrent Component-based Systems
Model-driven performance prediction methods require detailed design models to evaluate the performance of software systems during early development stages. However, the complexity...
Lucia Kapová, Steffen Becker
STACS
1993
Springer
15 years 10 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
ICALP
2010
Springer
15 years 11 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot