Sciweavers

847 search results - page 121 / 170
» Approximation algorithms for projective clustering
Sort
View
99
Voted
AAAI
2008
15 years 2 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
99
Voted
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 16 days ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
ATAL
2006
Springer
15 years 4 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
97
Voted
IPPS
2008
IEEE
15 years 7 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
88
Voted
WIKIS
2009
ACM
15 years 7 months ago
Bipartite networks of Wikipedia's articles and authors: a meso-level approach
This exploratory study investigates the bipartite network of articles linked by common editors in Wikipedia, ‘The Free Encyclopedia that Anyone Can Edit’. We use the articles ...
Rut Jesus, Martin Schwartz, Sune Lehmann