Sciweavers

1018 search results - page 114 / 204
» Property Testing in Computational Geometry
Sort
View
LATA
2009
Springer
14 years 4 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
13 years 8 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
IV
2005
IEEE
86views Visualization» more  IV 2005»
14 years 3 months ago
Visualizing Time Dependent Semantics: An Application to Quantum Algorithms
We have developed a visual syntax for representing concepts that are contingent on temporal properties (timedependent semantics). A within-group (N=24) experiment was conducted to...
Nivedita R. Kadaba, Pourang Irani, Michel Toulouse
LREC
2008
109views Education» more  LREC 2008»
13 years 11 months ago
The Italian Particle "ne": Corpus Construction and Analysis
The Italian particle ne exhibits interesting anaphoric properties that have not been yet explored in depth from a corpus and computational linguistic perspective. We provide: (i) ...
Malvina Nissim, Sara Perboni
WISES
2003
13 years 11 months ago
Built-In Fault Injectors - The Logical Continuation of BIST?
— With the increasing number of embedded computer systems being used in safety critical applications the testing and assessment of a system’s fault tolerance properties become ...
Andreas Steininger, Babak Rahbaran, Thomas Handl