Sciweavers

1578 search results - page 193 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
AAAI
2008
14 years 15 days ago
Exposing Parameters of a Trained Dynamic Model for Interactive Music Creation
As machine learning (ML) systems emerge in end-user applications, learning algorithms and classifiers will need to be robust to an increasingly unpredictable operating environment...
Dan Morris, Ian Simon, Sumit Basu
ICPR
2010
IEEE
14 years 5 days ago
A Fast Extension for Sparse Representation on Robust Face Recognition
We extend a recent Sparse Representation-based Classification (SRC) algorithm for face recognition to work on 2D images directly, aiming to reduce the computational complexity whil...
Hui-Ning Qiu, Duc-Son Pham, Wanquan Liu, Svetha Ve...
NIPS
2007
13 years 11 months ago
A Risk Minimization Principle for a Class of Parzen Estimators
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
IJCAI
2001
13 years 11 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su