3466 search results - page 307 / 694 » Fast computation of special resultants |
245
Voted
CGA
2002
15 years 6 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 ...
162
click to vote
RAS
2002
15 years 6 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...
199
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
149
click to vote
TASLP
2010
15 years 5 months ago
2010
—This paper presents a real-time piano synthesizer where both the transverse and longitudinal motion of the string is modeled by modal synthesis, resulting in a coherent and high...
189
click to vote
ISPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...