4865 search results - page 465 / 973 » The Complexity of Graph Connectivity |
227
click to vote
AAAI
2012
13 years 9 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
295
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
197
click to vote
DAM
2007
15 years 6 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
235
click to vote
ICIAR
2009
Springer
2009
Springer
Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior
16 years 1 months ago
Abstract. A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge whi...
164
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...