Sciweavers

1757 search results - page 330 / 352
» Alternating Refinement Relations
Sort
View
COR
2008
99views more  COR 2008»
13 years 10 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 10 months ago
Accelerating Large-scale Data Exploration through Data Diffusion
Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughpu...
Ioan Raicu, Yong Zhao, Ian T. Foster, Alexander S....
DAM
2010
137views more  DAM 2010»
13 years 10 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
CVIU
2008
296views more  CVIU 2008»
13 years 9 months ago
Image segmentation evaluation: A survey of unsupervised methods
Image segmentation is an important processing step in many image, video and computer vision applications. Extensive research has been done in creating many different approaches an...
Hui Zhang, Jason E. Fritts, Sally A. Goldman
AMAI
2006
Springer
13 years 9 months ago
An algebraic framework for temporal attribute characteristics
Most real-world database applications manage temporal data, i.e., data with associated time references that capture a temporal aspect of the data, typically either when the data i...
Michael H. Böhlen, Johann Gamper, Christian S...