Sciweavers

1289 search results - page 205 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
DEXA
2005
Springer
148views Database» more  DEXA 2005»
15 years 11 months ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
CPAIOR
2008
Springer
15 years 7 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
ICCV
2001
IEEE
16 years 7 months ago
Image Segmentation by Data Driven Markov Chain Monte Carlo
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...
Zhuowen Tu, Song Chun Zhu, Heung-Yeung Shum
EDBT
2006
ACM
143views Database» more  EDBT 2006»
16 years 6 months ago
XG: A Grid-Enabled Query Processing Engine
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
16 years 15 days ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios