Sciweavers

4117 search results - page 785 / 824
» On the Satisfiability of Complex Constraints
Sort
View
VLDB
2003
ACM
165views Database» more  VLDB 2003»
16 years 6 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 6 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ICSE
2004
IEEE-ACM
16 years 5 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun
MOBISYS
2007
ACM
16 years 5 months ago
MobiUS: enable together-viewing video experience across two mobile devices
We envision a new better-together mobile application paradigm where multiple mobile devices are placed in a close proximity and study a specific together-viewing video application...
Guobin Shen, Yanlin Li, Yongguang Zhang
EUROSYS
2007
ACM
16 years 2 months ago
Macroprogramming heterogeneous sensor networks using cosmos
In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming entails aggregate system behavior specification...
Asad Awan, Suresh Jagannathan, Ananth Grama