5196 search results - page 111 / 1040 » State of Application Assessment |
129
Voted
PADL
2005
Springer
15 years 9 months ago
2005
Springer
The need for direct memory manipulation through pointers is essential in many applications. However, it is also commonly understood that the use (or probably misuse) of pointers is...
134
click to vote
GI
2009
Springer
15 years 8 months ago
2009
Springer
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
163
Voted
IC
2004
15 years 4 months ago
2004
This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser th...
124
click to vote
COLING
2000
15 years 4 months ago
2000
A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
148
click to vote
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper takes phonetic information into account for data alignment in text-independent voice conversion. Hidden Markov Models are used for representing the phonetic structure o...