Sciweavers

7930 search results - page 642 / 1586
» Greedy in Approximation Algorithms
Sort
View
SI3D
2003
ACM
16 years 15 days ago
Interactive image-based rendering using feature globalization
Image-based rendering (IBR) systems enable virtual walkthroughs of photorealistic environments by warping and combining reference images to novel viewpoints under interactive user...
Daniel G. Aliaga, Dimah Yanovsky, Thomas A. Funkho...
WSNA
2003
ACM
16 years 15 days ago
Information-directed routing in ad hoc sensor networks
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
Juan Liu, Feng Zhao, Dragan Petrovic
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 12 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 11 months ago
Hip Implant Insertability Analysis: A Medical Instance of the Peg-In-Hole Problem
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
Leo Joskowicz, Russell H. Taylor
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 11 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang