Sciweavers

4451 search results - page 66 / 891
» On Random Ordering Constraints
Sort
View
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
15 years 4 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 5 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
JGO
2010
89views more  JGO 2010»
14 years 10 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
CVPR
2005
IEEE
16 years 1 months ago
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
Qiang Ji, Yang Wang 0002
ECCV
1994
Springer
15 years 4 months ago
Markov Random Field Models in Computer Vision
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Stan Z. Li