1102 search results - page 198 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
115
Voted
IJCV
2006
15 years 13 days ago
2006
3D reconstruction of a dynamic scene from features in two cameras usually requires synchronization and correspondences between the cameras. These may be hard to achieve due to occl...
114
click to vote
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
116
click to vote
HPDC
2002
IEEE
15 years 5 months ago
2002
IEEE
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
172
Voted
KES
2006
Springer
15 years 11 days ago
2006
Springer
With the development of service robots and with the emerging concept of the ubiquitous world, localization of a mobile robot has become a popular issue. Even though several localiz...
117
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...