Sciweavers

2324 search results - page 47 / 465
» A Fast Keyword-Spotting Technique
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
14 years 10 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
CORR
2007
Springer
114views Education» more  CORR 2007»
14 years 9 months ago
Fast Recursive Coding Based on Grouping of Symbols
— A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indi...
Nikolay N. Ponomarenko, Vladimir V. Lukin, Karen O...
ISEUD
2009
Springer
15 years 4 months ago
Fast, Accurate Creation of Data Validation Formats by End-User Developers
Abstract. Inputs to web forms often contain typos or other errors. However, existing web form design tools require end-user developers to write regular expressions (“regexps”) ...
Christopher Scaffidi, Brad A. Myers, Mary Shaw
CEC
2005
IEEE
15 years 3 months ago
Fast evolution of custom machine representations
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
Lorenz Huelsbergen
NIPS
2008
14 years 11 months ago
Fast Prediction on a Tree
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
Mark Herbster, Massimiliano Pontil, Sergio Rojas G...