Sciweavers

2949 search results - page 261 / 590
» Universal Sparse Modeling
Sort
View
CSL
2010
Springer
15 years 5 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
JOLLI
2002
109views more  JOLLI 2002»
15 years 3 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
16 years 4 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
ICASSP
2008
IEEE
15 years 10 months ago
A covariance kernel for SVM language recognition
Discriminative training for language recognition has been a key tool for improving system performance. In addition, recognition directly from shifted-delta cepstral features has p...
William M. Campbell
IDEAS
2003
IEEE
73views Database» more  IDEAS 2003»
15 years 9 months ago
Operations on Metamodels in the Context of a UML-Based Metamodeling Architecture
In the context of information system engineering, we propose a four-layer metamodeling architecture with a comprehensive set of operations on metamodels. Our architecture enables ...
Marie-Noëlle Terrasse, George Becker, Marinet...