1594 search results - page 163 / 319 » An Algorithm to Compute Collusion Paths |
122
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial sur...
145
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
123
click to vote
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
139
Voted
NETGAMES
2003
ACM
15 years 8 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
143
Voted
AINA
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— We propose a unified cross layer routing protocol with multiple constraints for CDMA multihop cellular networks (MCN). Multiple constraints are imposed on intermediate...