Sciweavers

1322 search results - page 178 / 265
» Parameterized counting problems
Sort
View
TON
1998
186views more  TON 1998»
15 years 3 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
JFP
2008
97views more  JFP 2008»
15 years 2 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
IGPL
2010
97views more  IGPL 2010»
15 years 2 months ago
A symbolic/subsymbolic interface protocol for cognitive modeling
Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential...
Patrick Simen, Thad A. Polk
TMI
2010
164views more  TMI 2010»
14 years 10 months ago
Robust Reconstruction of MRSI Data Using a Sparse Spectral Model and High Resolution MRI Priors
We introduce a novel algorithm to address the challenges in magnetic resonance (MR) spectroscopic imaging. In contrast to classical sequential data processing schemes, the proposed...
Ramin Eslami, Mathews Jacob
CVPR
2012
IEEE
13 years 6 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...