3068 search results - page 404 / 614 » Clustering with Multiple Graphs |
177
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The existing synteny block reconstruction algorithms use anchors (e.g., orthologous genes) shared over all genomes to construct the synteny blocks for multiple genomes. T...
197
click to vote
ESTIMEDIA
2007
Springer
16 years 23 days ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
210
click to vote
VAST
2004
ACM
16 years 15 hour ago
2004
ACM
Digitizing real-life objects via range scanners, stereo vision or tactile sensors usually requires the composition of multiple range images. In this paper we exploit intensity ima...
181
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
147
click to vote
AIIDE
2008
15 years 9 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...