Sciweavers

88 search results - page 1 / 18
» Complexity of Data Dependence problems for Program Schemas w...
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
INFOVIS
2002
IEEE
13 years 11 months ago
Visualization Schemas for Flexible Information Visualization
Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept...
Chris North, Nathan Conklin, Varun Saini
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 7 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
TKDE
2008
121views more  TKDE 2008»
13 years 6 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
EUROSYS
2011
ACM
12 years 10 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues