Sciweavers

3809 search results - page 723 / 762
» Randomized Broadcast in Networks
Sort
View
MP
1998
109views more  MP 1998»
13 years 8 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
TSMC
2002
110views more  TSMC 2002»
13 years 8 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Non-atomic Games for Multi-User Systems
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
Nicolas Bonneau, Mérouane Debbah, Eitan Alt...
TCAD
2008
92views more  TCAD 2008»
13 years 8 months ago
IP Watermarking Using Incremental Technology Mapping at Logic Synthesis Level
Abstract--This paper proposes an adaptive watermarking technique by modulating some closed cones in an originally optimized logic network (master design) for technology mapping. Th...
Aijiao Cui, Chip-Hong Chang, Sofiène Tahar
IJAR
2010
91views more  IJAR 2010»
13 years 7 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens