Sciweavers

246 search results - page 3 / 50
» Stable domination and weight
Sort
View
DAM
2006
100views more  DAM 2006»
13 years 5 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
NECO
2008
60views more  NECO 2008»
13 years 5 months ago
Sleeping Our Way to Weight Normalization and Stable Learning
The functions of sleep have been an enduring mystery. Recently, Tononi and Cirelli hypothesized that one of the functions of slow-wave sleep is to scale down synapses in the corte...
Thomas J. Sullivan, Virginia R. de Sa
CVPR
2008
IEEE
14 years 7 months ago
Enforcing non-positive weights for stable support vector tracking
In this paper we demonstrate that the support vector tracking (SVT) framework first proposed by Avidan is equivalent to the canonical Lucas-Kanade (LK) algorithm with a weighted E...
Simon Lucey
ICALP
1991
Springer
13 years 9 months ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
SCAM
2008
IEEE
14 years 5 days ago
Is Cloned Code More Stable than Non-cloned Code?
This paper presents a study on the stability of cloned code. The results from an analysis of 200 weeks of evolution of five software system show that the stability as measured by...
Jens Krinke