Sciweavers

688 search results - page 45 / 138
» The Flow Set with Partial Order
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 11 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ICAPR
2005
Springer
14 years 3 months ago
Optical Flow-Based Segmentation of Containers for Automatic Code Recognition
This paper presents a method for accurately segmenting moving container trucks in image sequences. This task allows to increase the performance of a recognition system that must id...
Vicente Atienza, Ángel Rodas, Gabriela Andr...
RTCSA
2000
IEEE
14 years 2 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
SIGMETRICS
2000
ACM
107views Hardware» more  SIGMETRICS 2000»
14 years 2 months ago
Detecting shared congestion of flows via end-to-end measurement
Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flow...
Dan Rubenstein, James F. Kurose, Donald F. Towsley
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 9 months ago
The Role of Commutativity in Constraint Propagation Algorithms
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
Krzysztof R. Apt