Sciweavers

6142 search results - page 872 / 1229
» The Complexity of Partition Functions
Sort
View
VLDB
2007
ACM
182views Database» more  VLDB 2007»
16 years 27 days ago
Continuous Queries in Oracle
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...
WORDS
2005
IEEE
16 years 10 days ago
Virtual Networks in an Integrated Time-Triggered Architecture
Depending on the physical structuring of large distributed safety-critical real-time systems, one can distinguish federated and integrated system architectures. This paper investi...
Roman Obermaisser, Philipp Peti, Hermann Kopetz
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 9 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ICS
2005
Tsinghua U.
16 years 8 days ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
ER
2004
Springer
169views Database» more  ER 2004»
16 years 5 days ago
Intentional Modeling to Support Identity Management
Identity management has arisen as a major and urgent challenge for internet-based communications and information services. Internet services involve complex networks of relationshi...
Lin Liu, Eric S. K. Yu