Sciweavers

461 search results - page 24 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
160
Voted
POPL
2008
ACM
15 years 10 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
PODS
2010
ACM
197views Database» more  PODS 2010»
14 years 9 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
POPL
2003
ACM
15 years 10 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost
KDD
2000
ACM
162views Data Mining» more  KDD 2000»
15 years 1 months ago
Data Mining from Functional Brain Images
Recent advances in functional brain imaging enable identication of active areas of a brain performing a certain function. Induction of logical formulas describing relations betwee...
Mitsuru Kakimoto, Chie Morita, Yoshiaki Kikuchi, H...
ICCAD
2009
IEEE
118views Hardware» more  ICCAD 2009»
14 years 7 months ago
Memory organization and data layout for instruction set extensions with architecturally visible storage
Present application specific embedded systems tend to choose instruction set extensions (ISEs) based on limitations imposed by the available data bandwidth to custom functional un...
Panagiotis Athanasopoulos, Philip Brisk, Yusuf Leb...