Sciweavers

5082 search results - page 780 / 1017
» Hierarchical Genetic Algorithms
Sort
View
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
16 years 6 months ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 6 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...
IPMI
2009
Springer
16 years 1 months ago
Exploratory fMRI Analysis without Spatial Normalization
Abstract. We present an exploratory method for simultaneous parcellation of multisubject fMRI data into functionally coherent areas. The method is based on a solely functional repr...
Danial Lashkari, Polina Golland
ICASSP
2009
IEEE
16 years 1 months ago
Bayesian sparse image reconstruction for MRFM
In this paper, we propose a Bayesian model and a Monte Carlo Markov chain (MCMC) algorithm for reconstructing images that consist of only few non-zero pixels. An appropriate distr...
Nicolas Dobigeon, Alfred O. Hero, Jean-Yves Tourne...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 1 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl