2743 search results - page 406 / 549 » Minimization of an M-convex Function |
149
click to vote
AAAI
2007
15 years 8 months ago
2007
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency bet...
161
click to vote
CIMAGING
2010
15 years 7 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
162
click to vote
IPCO
2010
15 years 7 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
144
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
The Passive Aggressive framework [1] is a principled approach to online linear classification that advocates minimal weight updates i.e., the least required so that the current tr...
173
click to vote
SPIESR
1997
15 years 7 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...