10916 search results - page 322 / 2184 » On Constructive Connectives and Systems |
173
click to vote
CSC
2007
15 years 8 months ago
2007
A visualization framework can be seen as a solution to a specialized data flow problem. Spiegel1 is a visualization framework which uses the Unix pipeline model to execute program...
191
click to vote
NIPS
2008
15 years 8 months ago
2008
We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
178
click to vote
UAI
2004
15 years 8 months ago
2004
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
181
click to vote
IPCO
1993
15 years 8 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
152
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...