Sciweavers

4451 search results - page 120 / 891
» On Random Ordering Constraints
Sort
View
ICIP
2003
IEEE
16 years 6 months ago
A probabilistic framework for image segmentation
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
Slawo Wesolkowski, Paul W. Fieguth
ENDM
2006
70views more  ENDM 2006»
15 years 4 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
15 years 10 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
ICIP
2001
IEEE
16 years 6 months ago
Robust fast extraction of video objects combining frame differences and adaptive reference image
This paper introduces a video object segmentation algorithm developed in the context of the European project Art.live1 where constraints on the quality of segmentation and the pro...
Alice Caplier, Laurent Bonnaud, Jean-Marc Chassery
ASMTA
2009
Springer
92views Mathematics» more  ASMTA 2009»
15 years 8 months ago
Comparison of Multi-service Routing Strategies for IP Core Networks
Abstract. Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when ...
Ulf Jensen, Armin Heindl