Sciweavers

2629 search results - page 425 / 526
» Build a Computer from Scratch
Sort
View
CORR
1998
Springer
103views Education» more  CORR 1998»
14 years 9 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
JMLR
2002
106views more  JMLR 2002»
14 years 9 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
PE
2002
Springer
132views Optimization» more  PE 2002»
14 years 9 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 9 months ago
Streaming Queries over Streaming Data
Recent work on querying data streams has focused on systems where newly arriving data is processed and continuously streamed to the user in real-time. In many emerging application...
Sirish Chandrasekaran, Michael J. Franklin
IANDC
2010
116views more  IANDC 2010»
14 years 8 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...