Sciweavers

1688 search results - page 304 / 338
» The Complexity of Rationalizing Matchings
Sort
View
GG
2008
Springer
13 years 8 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
ICC-CLASS: isotopically-coded cleavable crosslinking analysis software suite
Background: Successful application of crosslinking combined with mass spectrometry for studying proteins and protein complexes requires specifically-designed crosslinking reagents...
Evgeniy V. Petrotchenko, Christoph H. Borchers
BMCBI
2008
115views more  BMCBI 2008»
13 years 7 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
IJON
2007
112views more  IJON 2007»
13 years 7 months ago
Extraction of spatio-temporal primitives of emotional body expressions
Experimental and computational studies suggest that complex motor behavior is based on simpler spatiotemporal primitives, or synergies. This has been demonstrated by application o...
Lars Omlor, Martin A. Giese
TCAD
2008
101views more  TCAD 2008»
13 years 7 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin