Sciweavers

970 search results - page 24 / 194
» case 2011
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 11 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
ICANN
2011
Springer
12 years 11 months ago
Extending Tree Kernels with Topological Information
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
TMI
2011
147views more  TMI 2011»
13 years 2 months ago
Labeling of Lumbar Discs Using Both Pixel- and Object-Level Features With a Two-Level Probabilistic Model
Abstract—Backbone anatomical structure detection and labeling is a necessary step for various analysis tasks of the vertebral column. Appearance, shape and geometry measurements ...
Raja' S. Alomari, Jason J. Corso, Vipin Chaudhary
ICST
2011
IEEE
12 years 11 months ago
It is Not the Length That Matters, It is How You Control It
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
Gordon Fraser, Andrea Arcuri
TCS
2011
13 years 2 months ago
The three column Bandpass problem is solvable in linear time
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
Zhong Li, Guohui Lin