Sciweavers

2100 search results - page 179 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
SOCIALCOM
2010
15 years 4 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
ICASSP
2011
IEEE
14 years 10 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 7 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
16 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
ICML
2007
IEEE
16 years 7 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu