4201 search results - page 120 / 841 » Interaction graphs: Additives |
142
click to vote
NAR
2011
14 years 7 months ago
2011
Domain Interaction MAp (DIMA, available at http:// webclu.bio.wzw.tum.de/dima) is a database of predicted and known interactions between protein domains. It integrates 5807 struct...
147
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
133
click to vote
DIGRA
2005
Springer
15 years 10 months ago
2005
Springer
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...
131
click to vote
CPC
2006
15 years 4 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
151
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...