Sciweavers

4835 search results - page 582 / 967
» Refactoring Functional Programs
Sort
View
ICALP
2009
Springer
16 years 7 months ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
Kazuyuki Amano
ICCD
2003
IEEE
98views Hardware» more  ICCD 2003»
16 years 3 months ago
Specifying and Verifying Systems with Multiple Clocks
Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling th...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
ICSE
2009
IEEE-ACM
16 years 1 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss
CALCO
2009
Springer
172views Mathematics» more  CALCO 2009»
16 years 1 months ago
Coalgebraic Components in a Many-Sorted Microcosm
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
ER
2009
Springer
92views Database» more  ER 2009»
16 years 1 months ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link