554 search results - page 39 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
COLT
1993
Springer
14 years 26 days ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...
IPPS
1997
IEEE
14 years 29 days ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
ISCIS
2005
Springer
14 years 2 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
ICIP
2005
IEEE
14 years 2 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...