Sciweavers

6142 search results - page 1099 / 1229
» The Complexity of Partition Functions
Sort
View
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
15 years 9 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
ICMCS
2000
IEEE
84views Multimedia» more  ICMCS 2000»
15 years 8 months ago
Multi-modal Interaction in the Age of Information Appliances
The coming millenium will be characterized by the availability of multiple information appliances that make ubiquitous information access an accepted fact of life. The ability to ...
Stéphane H. Maes, T. V. Raman
NOMS
2000
IEEE
176views Communications» more  NOMS 2000»
15 years 8 months ago
Design and analysis of a proactive application management system (PAMS)
Management of large-scale Network-Centric Systems (NCS) and their applications is an extremely complex and challenging task due to factors such as centralized management architect...
Salim Hariri, Yoonhee Kim
CODES
1999
IEEE
15 years 8 months ago
How standards will enable hardware/software co-design
o much higher levels of abstraction than today's design practices, which are usually at the level of synthesizable RTL for custom hardware or Instruction Set Simulator (ISS) f...
Mark Genoe, Christopher K. Lennard, Joachim Kunkel...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 8 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
« Prev « First page 1099 / 1229 Last » Next »