Sciweavers

343 search results - page 25 / 69
» The scale of edges
Sort
View
94
Voted
ICCV
2007
IEEE
16 years 1 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 5 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
ICCV
2009
IEEE
16 years 4 months ago
Domain Adaptive Semantic Diffusion for Large Scale Context-Based Video Annotation
Learning to cope with domain change has been known as a challenging problem in many real-world applications. This paper proposes a novel and efficient approach, named domain ada...
Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah ...
INFOCOM
2007
IEEE
15 years 6 months ago
Distributed Placement of Service Facilities in Large-Scale Networks
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
Nikolaos Laoutaris, Georgios Smaragdakis, Konstant...
CLUSTER
2006
IEEE
15 years 5 months ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...