Sciweavers

1469 search results - page 159 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
STACS
1994
Springer
14 years 2 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
BMCBI
2007
153views more  BMCBI 2007»
13 years 10 months ago
An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network
Background: Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this ...
Brian J. Holden, John W. Pinney, Simon C. Lovell, ...
GIR
2006
ACM
14 years 4 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
DATE
2009
IEEE
116views Hardware» more  DATE 2009»
14 years 4 months ago
A high-level debug environment for communication-centric debug
—A large part of a modern SOC’s debug complexity resides in the interaction between the main system components. ion-level debug moves the abstraction level of the debug process...
Kees Goossens, Bart Vermeulen, Ashkan Beyranvand N...
IJCAI
2003
13 years 11 months ago
Concept Linking for Information Integration in Open Book and Sentinel
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
Stuart Watt