Sciweavers

656 search results - page 115 / 132
» Marrying Words and Trees
Sort
View
IANDC
2007
151views more  IANDC 2007»
14 years 11 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
INFFUS
2007
117views more  INFFUS 2007»
14 years 11 months ago
Pixel-based and region-based image fusion schemes using ICA bases
The task of enhancing the perception of a scene by combining information captured by different sensors is usually known as image fusion. The pyramid decomposition and the Dual-Tr...
Nikolaos Mitianoudis, Tania Stathaki
JDA
2007
156views more  JDA 2007»
14 years 11 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
80
Voted
TVCG
2008
86views more  TVCG 2008»
14 years 11 months ago
The Shaping of Information by Visual Metaphors
The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore...
Caroline Ziemkiewicz, Robert Kosara
AI
2002
Springer
14 years 11 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo