Sciweavers

6894 search results - page 914 / 1379
» Generation Problems
Sort
View
IDA
2009
Springer
16 years 1 months ago
How to Control Clustering Results? Flexible Clustering Aggregation
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
ICMCS
2005
IEEE
103views Multimedia» more  ICMCS 2005»
16 years 14 days ago
Neighborhood issue in single-frame image super-resolution
Super-Resolution is the problem of generating one or a set of high-resolution images from one or a sequence of lowresolution frames. Most methods have been proposed for super-reso...
K. Su, Qi Tian, Qing Xue, Nicu Sebe, Jingsheng Ma
ACSW
2006
15 years 8 months ago
Improving resource utilisation in market oriented grid management and scheduling
Service providers of the future could dynamically negotiate for, and create their infrastructure on Grid based utility computing and communication providers. Such commercialisatio...
Kris Bubendorfer
AIPS
2009
15 years 8 months ago
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP...
Alfonso Gerevini, Alessandro Saetti, Mauro Vallati
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 5 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi