60 search results - page 10 / 12 » Pairing Functions, Boolean Evaluation and Binary Decision Di... |
DIS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
80
Voted
RELMICS
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
127
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...