Sciweavers

4315 search results - page 748 / 863
» Sorting in linear time
Sort
View
JACM
2010
116views more  JACM 2010»
13 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
JMLR
2010
155views more  JMLR 2010»
13 years 8 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
MA
2010
Springer
132views Communications» more  MA 2010»
13 years 8 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
MIAR
2010
IEEE
13 years 8 months ago
Marker-Free Registration for Electromagnetic Navigation Bronchoscopy under Respiratory Motion
Abstract. Electromagnetic navigation bronchoscopy requires the accurate registration of a preinterventional computed tomography (CT) image to the coordinate system of the electroma...
Marco Feuerstein, Takamasa Sugiura, Daisuke Deguch...
MICCAI
2010
Springer
13 years 8 months ago
Sparse Bayesian Learning for Identifying Imaging Biomarkers in AD Prediction
Abstract. We apply sparse Bayesian learning methods, automatic relevance determination (ARD) and predictive ARD (PARD), to Alzheimer’s disease (AD) classification to make accura...
Li Shen, Yuan Qi, Sungeun Kim, Kwangsik Nho, Jing ...