Sciweavers

5153 search results - page 242 / 1031
» Introduction to Randomized Algorithms
Sort
View
132
Voted
AAAI
2008
15 years 5 months ago
Constrained Classification on Structured Data
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...
Chi-Hoon Lee, Matthew R. G. Brown, Russell Greiner...
131
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 3 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
128
Voted
KBSE
2007
IEEE
15 years 9 months ago
Nighthawk: a two-level genetic-random unit test data generator
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
James H. Andrews, Felix Chun Hang Li, Tim Menzies
162
Voted
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 5 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
131
Voted
CVPR
2012
IEEE
13 years 5 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould