Sciweavers

19 search results - page 3 / 4
» On the Complexity of Hilbert's 17th Problem
Sort
View
ICASSP
2010
IEEE
13 years 6 months ago
Frame domain signal processing: Framework and applications
Besides basis expansions, frames representations play a key role in signal processing. We thus consider the problem of frame domain signal processing, which is more complex and ch...
Amina Chebira, Matthew Fickus, Martin Vetterli
JMLR
2010
146views more  JMLR 2010»
13 years 24 days ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
ASE
1998
89views more  ASE 1998»
13 years 5 months ago
Extending Design Environments to Software Architecture Design
Designing a complex software system is a cognitivelychallengingtask; thus, designers need cognitive support to create good designs. Domain-oriented design environments are cooperat...
Jason E. Robbins, David M. Hilbert, David F. Redmi...
ALT
2007
Springer
14 years 3 months ago
Learning Kernel Perceptrons on Noisy Data Using Random Projections
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
Guillaume Stempfel, Liva Ralaivola