Sciweavers

2109 search results - page 237 / 422
» Solving Necklace Constraint Problems
Sort
View
JSAC
2008
151views more  JSAC 2008»
15 years 6 months ago
Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio Networks
A cognitive radio (CR) network is often described as a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multi...
Lan Zhang, Ying-Chang Liang, Yan Xin
193
Voted
CP
2010
Springer
15 years 4 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
MICCAI
2004
Springer
16 years 7 months ago
Coupling Statistical Segmentation and PCA Shape Modeling
This paper presents a novel segmentation approach featuring shape constraints of multiple structures. A framework is developed combining statistical shape modeling with a maximum a...
Kilian M. Pohl, Simon K. Warfield, Ron Kikinis, W....
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 11 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...