Sciweavers

11051 search results - page 80 / 2211
» An Investigation of Generalized Cases
Sort
View
NIPS
2001
13 years 11 months ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 10 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
TSP
2010
13 years 5 months ago
Generalized triangular decomposition in transform coding
A general family of optimal transform coders (TCs) is introduced here based on the generalized triangular decomposition (GTD) developed by Jiang et al. This family includes the Kar...
Ching-Chih Weng, Chun-Yang Chen, P. P. Vaidyanatha...
ESEM
2009
ACM
14 years 2 months ago
Test coverage and post-verification defects: A multiple case study
Test coverage is a promising measure of test effectiveness and development organizations are interested in costeffective levels of coverage that provide sufficient fault removal w...
Audris Mockus, Nachiappan Nagappan, Trung T. Dinh-...
CIE
2007
Springer
14 years 2 months ago
A Weakly 2-Random Set That Is Not Generalized Low
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
Andrew Lewis, Antonio Montalbán, Andr&eacut...