Sciweavers

365 search results - page 29 / 73
» Reconfigurations in Graphs and Grids
Sort
View
JEI
2006
82views more  JEI 2006»
14 years 11 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 3 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
15 years 3 months ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...
GIS
2005
ACM
16 years 26 days ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
FGCS
2002
138views more  FGCS 2002»
14 years 11 months ago
Armada: a parallel I/O framework for computational grids
High-performance computing increasingly occurs on "computational grids" composed of heterogeneous and geographically distributed systems of computers, networks, and stor...
Ron Oldfield, David Kotz