Sciweavers

4866 search results - page 215 / 974
» UML for Global Computing
Sort
View
GECCO
2004
Springer
15 years 10 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
15 years 10 months ago
A genetic algorithm for simultaneous localization and mapping
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
Tom Duckett
131
Voted
WSCG
2004
136views more  WSCG 2004»
15 years 6 months ago
Light Vectors for a Moving Observer
Interactive rendering is usually made with very simple illumination models. High quality rendering is too slow to be interactive. In this paper, we extend the notion of light vect...
Rodolphe Crespin, Bernard Péroche
DAC
1998
ACM
16 years 5 months ago
Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs
In this paper we present a new global router appropriate for Multichip Module MCM and dense Printed Circuit Board PCB design, which utilizes a hybrid of the classical rip-up and r...
Jason Cong, Patrick H. Madden
154
Voted
CVPR
2012
IEEE
13 years 7 months ago
Detecting regions of interest in dynamic scenes with camera motions
We present a method to detect the regions of interests in moving camera views of dynamic scenes with multiple moving objects. We start by extracting a global motion tendency that ...
Kihwan Kim, Dongryeol Lee, Irfan A. Essa