1115 search results - page 156 / 223 » Separating Shape Graphs |
INFOCOM
1993
IEEE
15 years 3 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
GCB
2009
Springer
15 years 2 months ago
2009
Springer
: Understanding complex biological systems requires data from manifold biological levels. Often this data is analysed in some meaningful context, for example, by integrating it int...
120
click to vote
FDL
2004
IEEE
15 years 2 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
CEC
2005
IEEE
15 years 1 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
107
click to vote
DICTA
2003
15 years 13 days ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...