Sciweavers

712 search results - page 98 / 143
» A mixture model for random graphs
Sort
View
TMI
2008
136views more  TMI 2008»
13 years 7 months ago
Classification of fMRI Time Series in a Low-Dimensional Subspace With a Spatial Prior
We propose a new method for detecting activation in functional magnetic resonance imaging (fMRI) data. We project the fMRI time series on a low-dimensional subspace spanned by wave...
François G. Meyer, Xilin Shen
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
13 years 7 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
IVC
2008
141views more  IVC 2008»
13 years 7 months ago
Segmentation of color images via reversible jump MCMC sampling
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
Zoltan Kato
FUIN
2008
98views more  FUIN 2008»
13 years 7 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 11 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...