Sciweavers

1963 search results - page 277 / 393
» The Maximum Solution Problem on Graphs
Sort
View
80
Voted
CVPR
2003
IEEE
16 years 2 months ago
Object-Specific Figure-Ground Segregation
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
Stella X. Yu, Jianbo Shi
96
Voted
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 5 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
91
Voted
CASES
2007
ACM
15 years 4 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
90
Voted
ICC
2007
IEEE
150views Communications» more  ICC 2007»
15 years 4 months ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
102
Voted
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 19 days ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will