Sciweavers

792 search results - page 52 / 159
» Constrained Ramsey Numbers
Sort
View
121
Voted
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 2 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
ISCAS
2007
IEEE
135views Hardware» more  ISCAS 2007»
15 years 7 months ago
Diophantine Frequency Synthesis The Mathematical Principles
— Diophantine Frequency Synthesis1 is a new approach to fine-step and fast-hopping frequency synthesis that is based on mathematical properties of integer numbers and Diophantin...
Paul-Peter Sotiriadis
83
Voted
DAM
2007
91views more  DAM 2007»
15 years 19 days ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
97
Voted
NN
2002
Springer
161views Neural Networks» more  NN 2002»
15 years 10 days ago
AANN: an alternative to GMM for pattern recognition
The objective in any pattern recognition problem is to capture the characteristics common to each class from feature vectors of the training data. While Gaussian mixture models ap...
B. Yegnanarayana, S. P. Kishore
118
Voted
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 7 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang