5608 search results - page 190 / 1122 » On the Theory of Matchgate Computations |
AUTOMOTIVEUI
2009
ACM
15 years 8 months ago
2009
ACM
Intuitive use is met when prior knowledge is transferred to new task environments. The empirical fact that transfer relies on schemas led us to diagnose intuitiveness based on sch...
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
127
click to vote
IJON
2008
15 years 1 months ago
2008
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...
271
Voted
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
99
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...