Sciweavers

2446 search results - page 453 / 490
» Choiceless Polynomial Time
Sort
View
NC
2011
201views Neural Networks» more  NC 2011»
14 years 11 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
TSP
2011
142views more  TSP 2011»
14 years 11 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
JAIR
2010
130views more  JAIR 2010»
14 years 10 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
JMLR
2010
134views more  JMLR 2010»
14 years 10 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
TIT
2010
113views Education» more  TIT 2010»
14 years 10 months ago
Asynchronous CDMA systems with random spreading-part II: design criteria
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
Laura Cottatellucci, Ralf R. Müller, Mé...