Sciweavers

3946 search results - page 307 / 790
» The computational complexity of choice sets
Sort
View
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 4 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
CHI
2009
ACM
16 years 7 months ago
Friend or foe?: examining CAS use in mathematics research
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
Andrea Bunt, Michael Terry, Edward Lank
CVPR
2005
IEEE
16 years 8 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
CVPR
2007
IEEE
16 years 8 months ago
Fast Terrain Classification Using Variable-Length Representation for Autonomous Navigation
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
PDP
2007
IEEE
16 years 1 months ago
Monitoring and Analysis Framework for Grid Middleware
As the use of complex grid middleware becomes widespread and more facilites are offered by these pieces of software, distributed Grid applications are becoming more and more popul...
Ramon Nou, Ferran Julià, David Carrera, Kev...