Sciweavers

12289 search results - page 2178 / 2458
» computing 2006
Sort
View
DLT
2006
15 years 5 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
DLT
2006
15 years 5 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
DMIN
2006
114views Data Mining» more  DMIN 2006»
15 years 5 months ago
Towards Using Fewer Features for Text Classification
Abstract-- Text classification or categorization is a conventional classification problem applied to the text domain. In the cases when statistical classification methods are used,...
Yuan Yuan, Tianyang Gu
ECIR
2006
Springer
15 years 5 months ago
An Information Retrieval System for Motion Capture Data
Motion capturing has become an important tool in fields such as sports sciences, biometrics, and particularly in computer animation, where large collections of motion material are ...
Bastian Demuth, Tido Röder, Meinard Müll...
ERSA
2006
161views Hardware» more  ERSA 2006»
15 years 5 months ago
A Parametric Study of Scalable Interconnects on FPGAs
Abstract-- With the constantly increasing gate capacity of FPGAs, a single FPGA chip is able to employ large-scale applications. To connect a large number of computational nodes, N...
Daihan Wang, Hiroki Matsutani, Masato Yoshimi, Mic...
« Prev « First page 2178 / 2458 Last » Next »