Sciweavers

9842 search results - page 1872 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
OSDI
2002
ACM
14 years 10 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
VLDB
2007
ACM
104views Database» more  VLDB 2007»
14 years 10 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 10 months ago
Answering Aggregation Queries in a Secure System Model
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past en...
Tingjian Ge, Stanley B. Zdonik
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 10 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 10 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
« Prev « First page 1872 / 1969 Last » Next »