Sciweavers

1477 search results - page 228 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
JCO
2006
126views more  JCO 2006»
14 years 9 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
TCS
2008
14 years 9 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
IJNM
2000
91views more  IJNM 2000»
14 years 9 months ago
Coding-based schemes for fault identification in communication networks
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
Chi-Chun Lo, Shing Hong Chen, Bon-Yeh Lin
AMDO
2010
Springer
14 years 7 months ago
Compatible Particles for Part-Based Tracking
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
Brais Martínez, Marc Vivet, Xavier Binefa
TIP
2010
129views more  TIP 2010»
14 years 4 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...