1399 search results - page 133 / 280 » Multi-party Finite Computations |
115
click to vote
TSMC
2008
15 years 4 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
164
click to vote
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The simulation of ultrasound wave propagation is of high interest in fields as ultrasound system development and therapeutic ultrasound. From a computational point of vi...
151
click to vote
PAAMS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
109
click to vote
RP
2010
Springer
15 years 1 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
137
click to vote
JUCS
2008
15 years 4 months ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...