Sciweavers

16504 search results - page 174 / 3301
» New Problems, New Solutions
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CVPR
2004
IEEE
16 years 8 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
ICPR
2006
IEEE
16 years 7 months ago
A new approach to the classification of mammographic masses and normal breast tissue
A new approach to mammographic mass detection is presented in this paper. Although different algorithms have been proposed for such a task, most of them are application dependent....
Arnau Oliver, Joan Martí, Robert Marti, Ann...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 7 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
16 years 20 days ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg