Sciweavers

5624 search results - page 489 / 1125
» On Conditional Covering Problem
Sort
View
DAGM
2006
Springer
15 years 10 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
ESORICS
2006
Springer
15 years 10 months ago
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses
Abstract. Mix networks are a popular mechanism for anonymous Internet communications. By routing IP traffic through an overlay chain of mixes, they aim to hide the relationship bet...
Vitaly Shmatikov, Ming-Hsiu Wang
GECCO
2010
Springer
163views Optimization» more  GECCO 2010»
15 years 10 months ago
Factors affecting the use of genetic algorithms in test suite augmentation
Test suite augmentation techniques are used in regression testing to help engineers identify code elements affected by changes, and generate test cases to cover those elements. R...
Zhihong Xu, Myra B. Cohen, Gregg Rothermel
IPPS
2000
IEEE
15 years 10 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
ICML
1995
IEEE
15 years 10 months ago
Learning with Rare Cases and Small Disjuncts
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
Gary M. Weiss