4865 search results - page 510 / 973 » The Complexity of Graph Connectivity |
182
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
167
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
163
click to vote
MOC
2010
15 years 1 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
212
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
306
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...