Sciweavers

4674 search results - page 146 / 935
» cases 2008
Sort
View
LREC
2008
80views Education» more  LREC 2008»
15 years 7 months ago
Turning a Term Extractor into a new Domain: first Experiences
Computational terminology has notably evolved since the advent of computers. Regarding the extraction of terms in particular, a large number of resources has been developed: from ...
Jorge Vivaldi, Anna Joan, Mercè Lorente
DM
2008
112views more  DM 2008»
15 years 6 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
NECO
2008
101views more  NECO 2008»
15 years 6 months ago
On the Classification Capability of Sign-Constrained Perceptrons
The perceptron (also referred to as McCulloch-Pitts neuron, or linear threshold gate) is commonly used as a simplified model for the discrimination and learning capability of a bi...
Robert A. Legenstein, Wolfgang Maass
TSE
1998
131views more  TSE 1998»
15 years 5 months ago
Experiences Using Lightweight Formal Methods for Requirements Modeling
—This paper describes three case studies in the lightweight application of formal methods to requirements modeling for spacecraft fault protection systems. The case studies diffe...
Steve M. Easterbrook, Robyn R. Lutz, Richard Covin...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 7 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar