Sciweavers

1322 search results - page 179 / 265
» Parameterized counting problems
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 4 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
150
Voted
ICPR
2004
IEEE
16 years 4 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
133
Voted
VLSID
2002
IEEE
172views VLSI» more  VLSID 2002»
16 years 4 months ago
Improvement of ASIC Design Processes
With device counts on modern-day ASICs crossing the 10 million mark, careful planning of an ASIC design project is necessary to meet time deadlines. Two problems arise in this con...
Vineet Sahula, C. P. Ravikumar, D. Nagchoudhuri
144
Voted
AINA
2007
IEEE
15 years 10 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
128
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Cooperative Spectrum Sensing and Detection for Cognitive Radio
—One of the main requirements of cognitive radio systems is the ability to reliably detect the presence of licensed primary transmissions. Previous works on the problem of detect...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli