Sciweavers

4255 search results - page 558 / 851
» On Learning Boolean Functions
Sort
View
ICML
2003
IEEE
16 years 3 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICASSP
2008
IEEE
15 years 9 months ago
Contextually adaptive signal representation using conditional principal component analysis
The conventional method of generating a basis that is optimally adapted (in MSE) for representation of an ensemble of signals is Principal Component Analysis (PCA). A more ambitio...
Rosa M. Figueras i Ventura, Umesh Rajashekar, Zhou...
113
Voted
NDSS
2007
IEEE
15 years 8 months ago
Fig: Automatic Fingerprint Generation
Fingerprinting is a widely used technique among the networking and security communities for identifying different implementations of the same piece of networking software running ...
Shobha Venkataraman, Juan Caballero, Pongsin Poosa...
ECML
2007
Springer
15 years 8 months ago
Source Separation with Gaussian Process Models
In this paper we address a method of source separation in the case where sources have certain temporal structures. The key contribution in this paper is to incorporate Gaussian pro...
Sunho Park, Seungjin Choi
109
Voted
ICCBR
2007
Springer
15 years 8 months ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...