Sciweavers

42 search results - page 7 / 9
» Part II: control theory for buffer sizing
Sort
View
CHI
2010
ACM
15 years 4 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
JBI
2006
117views Bioinformatics» more  JBI 2006»
14 years 9 months ago
Desiderata for domain reference ontologies in biomedicine
Domain reference ontologies represent knowledge about a particular part of the world in a way that is independent from specific objectives, through a theory of the domain. An exam...
Anita Burgun
SAC
2004
ACM
15 years 2 months ago
Web Services for E-commerce: guaranteeing security access and quality of service
Being E-commerce one of the most critical Internet application, it is fundamental to employ technologies which guarantee not only secure transactions but also an adequate quality ...
Mario Bravetti, Roberto Lucchi, Gianluigi Zavattar...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 1 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
CASES
2006
ACM
15 years 3 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson