Sciweavers

2266 search results - page 310 / 454
» Generalizing parametric timing analysis
Sort
View
IBPRIA
2007
Springer
14 years 4 months ago
On the Detection of Regions-of-Interest in Dynamic Contrast-Enhanced MRI
Multivariate imaging technologies such as Dynamic Contrast-Enhanced Magnetic Resonance Imaging (DCE-MRI) have recently gained an important attention as it improves tumour detection...
David Raba, Marta Peracaula, Robert Marti, Joan Ma...
MOBICOM
2003
ACM
14 years 4 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
COMPGEOM
2010
ACM
14 years 3 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 3 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
COLT
1993
Springer
14 years 2 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum