21108 search results - page 319 / 4222 » A General Class of Models of |
191
click to vote
SCHEDULING
2010
15 years 5 months ago
2010
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
146
click to vote
ICONIP
2009
15 years 4 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
187
click to vote
CRYPTO
2005
Springer
16 years 8 days ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
187
click to vote
LPNMR
2005
Springer
16 years 7 days ago
2005
Springer
We describe an application of Abductive Logic Programming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple...
184
Voted
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper we generalize the LARS feature selection method to the linear SVM model, derive an efficient algorithm for it, and empirically demonstrate its usefulness as a featur...