Sciweavers

611 search results - page 62 / 123
» The Cardinality Matrix Constraint
Sort
View
LACL
2001
Springer
15 years 2 months ago
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
Geoffrey K. Pullum, Barbara C. Scholz
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 2 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick
ATAL
2006
Springer
15 years 1 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
CAV
2008
Springer
158views Hardware» more  CAV 2008»
14 years 11 months ago
Linear Arithmetic with Stars
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
Ruzica Piskac, Viktor Kuncak
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 18 days ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park