Sciweavers

4797 search results - page 445 / 960
» The complexity of partition tasks
Sort
View
203
Voted
BMCBI
2006
94views more  BMCBI 2006»
15 years 7 months ago
Noise-injected neural networks show promise for use on small-sample expression data
Background: Overfitting the data is a salient issue for classifier design in small-sample settings. This is why selecting a classifier from a constrained family of classifiers, on...
Jianping Hua, James Lowey, Zixiang Xiong, Edward R...
185
Voted
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 6 months ago
Asymptotically-Good, Multigroup ML-Decodable STBCs
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
Natarajan Lakshmi Prasad, B. Sundar Rajan
TCAD
2010
136views more  TCAD 2010»
15 years 1 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris
215
Voted
TCSV
2010
15 years 1 months ago
Compressed Domain Video Object Segmentation
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
Fatih Murat Porikli, Faisal I. Bashir, Huifang Sun