Sciweavers

1001 search results - page 144 / 201
» Testing Formal Dialectic
Sort
View
PAKDD
1999
ACM
124views Data Mining» more  PAKDD 1999»
14 years 1 months ago
Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases
Empirical equations are an important class of regularities that can be discovered in databases. In this paper we concentrate on the role of equations as de nitions of attribute val...
Zbigniew W. Ras, Jan M. Zytkow
ICTAI
1992
IEEE
14 years 1 months ago
Automated Parameter Tuning in Stereo Vision Under Time Constraints
This paper presents a method for tuning parameters under a fixed time constraint for a general binocular stereo-vision algorithm. A major difficulty in stereo vision, as well as i...
Steven R. Schwartz, Benjamin W. Wah
OOPSLA
2010
Springer
13 years 7 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
SIGSOFT
2010
ACM
13 years 6 months ago
Differential static analysis: opportunities, applications, and challenges
It is widely believed that program analysis can be more closely targeted to the needs of programmers if the program is accompanied by further redundant documentation. This may inc...
Shuvendu K. Lahiri, Kapil Vaswani, C. A. R. Hoare
LICS
2012
IEEE
11 years 11 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan