Sciweavers

518 search results - page 23 / 104
» Beating a Random Assignment
Sort
View
SAT
2004
Springer
117views Hardware» more  SAT 2004»
15 years 11 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
16 years 16 days ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
DAC
1995
ACM
15 years 10 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram