Sciweavers

499 search results - page 45 / 100
» Why neighbor-joining works
Sort
View
JUCS
2008
141views more  JUCS 2008»
13 years 10 months ago
Designing Collaborative User Interfaces for Ubiquitous Applications Using CIAM: The AULA Case Study
: In this article we explain how we apply the CIAM methodology based on the CIAN notation in order to generate user interfaces in collaborative applications. CIAM has been applied ...
Maximiliano Paredes, Ana I. Molina, Miguel A. Redo...
CSUR
2000
61views more  CSUR 2000»
13 years 9 months ago
Framelets - small and loosely coupled frameworks
Not only the design of complex frameworks is hard, but also the reuse of such artefacts. Furthermore, the internal working of different frameworks is usually not compatible so that...
Wolfgang Pree, Kai Koskimies
COMPUTER
2002
115views more  COMPUTER 2002»
13 years 9 months ago
PKI: It's Not Dead, Just Resting
Despite enthusiastic predictions in the trade press, an X.509-style PKI has so far failed to eventuate to any significant degree. This paper looks at some of the reasons behind th...
Peter Gutmann
FMSD
1998
77views more  FMSD 1998»
13 years 9 months ago
An Analysis of Bitstate Hashing
The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat anal...
Gerard J. Holzmann
QUESTA
2007
88views more  QUESTA 2007»
13 years 9 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...