Sciweavers

1071 search results - page 64 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
HT
1991
ACM
13 years 11 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman
ERLANG
2004
ACM
14 years 1 months ago
Structured programming using processes
Structured Programming techniques are applied to a personal accounting software application implemented in erlang as a demonstration of the utility of processes as design construc...
Jay Nelson
VIS
2007
IEEE
115views Visualization» more  VIS 2007»
14 years 9 months ago
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 7 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...