539 search results - page 29 / 108 » Recurrence relations and fast algorithms |
103
click to vote
TCSV
2008
15 years 10 days ago
2008
This paper addresses the automatic analysis of court-net sports video content. We extract information about the players, the playing-field in a bottom-up way until we reach scene-l...
127
click to vote
TON
2008
15 years 9 days ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
108
Voted
COMPLIFE
2005
Springer
15 years 6 months ago
2005
Springer
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
118
click to vote
BMCBI
2006
15 years 14 days ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
105
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...