2127 search results - page 252 / 426 » Computing large matchings fast |
192
click to vote
CGA
2002
15 years 4 months ago
2002
Populated urban environments are very important in many applications such as urban planning and entertainment. However rendering in real time many people in a complex environment ...
119
click to vote
RAS
2002
15 years 4 months ago
2002
Autonomous landing is a challenging problem for aerial robots. An autonomous landing manoeuver depends largely on two capabilities: the decision of where to land and the generatio...
141
click to vote
DCC
2007
IEEE
16 years 4 months ago
2007
IEEE
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
140
click to vote
WABI
2009
Springer
15 years 11 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
152
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...