Sciweavers

1651 search results - page 230 / 331
» Measuring the Complexity of Classification Problems
Sort
View
URBAN
2008
86views more  URBAN 2008»
13 years 8 months ago
Social area analysis, data mining, and GIS
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
Seth E. Spielman, Jean-Claude Thill
PAMI
2007
187views more  PAMI 2007»
13 years 7 months ago
Supervised Learning of Semantic Classes for Image Annotation and Retrieval
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...
JMMA
2010
90views more  JMMA 2010»
13 years 3 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
SIAMNUM
2010
178views more  SIAMNUM 2010»
13 years 3 months ago
A New Class of High Order Finite Volume Methods for Second Order Elliptic Equations
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
Long Chen
TNN
2010
176views Management» more  TNN 2010»
13 years 2 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao