1512 search results - page 40 / 303 » connection 2006 |
101
click to vote
CIMCA
2006
IEEE
15 years 3 months ago
2006
IEEE
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...