Sciweavers

1322 search results - page 80 / 265
» Efficient Goal-Directed Exploration
Sort
View
AAAI
2010
13 years 11 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
APVIS
2008
13 years 11 months ago
Interactive Storyboard for Overall Time-Varying Data Visualization
Large amounts of time-varying datasets create great challenges for users to understand and explore them. This paper proposes an efficient visualization method for observing overal...
Aidong Lu, Han-Wei Shen
PE
2000
Springer
118views Optimization» more  PE 2000»
13 years 10 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
DATE
2003
IEEE
123views Hardware» more  DATE 2003»
14 years 3 months ago
Parallel Processing Architectures for Reconfigurable Systems
Novel reconfigurable computing architectures exploit the inherent parallelism available in many signalprocessing problems. These architectures often consist of networks of compute...
Kees A. Vissers
BCSHCI
2007
13 years 11 months ago
Using hierarchies to support non-visual access to relational diagrams
This paper describes an approach to support non-visual exploration of graphically represented information. We used a hierarchical structure to organize the information encoded in ...
Oussama Metatla, Nick Bryan-Kinns, Tony Stockman