6740 search results - page 1008 / 1348 » An s -Hamiltonian Line Graph Problem |
273
click to vote
BVAI
2007
Springer
16 years 1 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
175
click to vote
SOFSEM
2007
Springer
16 years 28 days ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
166
click to vote
CVPR
2006
IEEE
16 years 26 days ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
276
click to vote
ICPP
2006
IEEE
16 years 26 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
186
click to vote
ICTAI
2006
IEEE
16 years 25 days ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...