Sciweavers

3368 search results - page 648 / 674
» GRID Computing
Sort
View
EVOW
2007
Springer
13 years 11 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
ECCV
2006
Springer
14 years 9 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
VIS
2004
IEEE
135views Visualization» more  VIS 2004»
14 years 9 months ago
Adaptive 4-8 Texture Hierarchies
We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced base...
Kenneth I. Joy, Lok M. Hwa, Mark A. Duchaineau
SIGMOD
2007
ACM
197views Database» more  SIGMOD 2007»
14 years 8 months ago
Automated and on-demand provisioning of virtual machines for database applications
Utility computing delivers compute and storage resources to applications as an `on-demand utility', much like electricity, from a distributed collection of computing resource...
Piyush Shivam, Azbayar Demberel, Pradeep Gunda, Da...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Two-Colored Pixels
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
Darko Pavic and Leif Kobbelt