429 search results - page 57 / 86 » Solving the Maximum Clique Problem Using PUBB |
MICCAI
2009
Springer
14 years 8 months ago
2009
Springer
We study the problem of classifying mild Alzheimer's disease (AD) subjects from healthy individuals (controls) using multi-modal image data, to facilitate early identification...
INFOCOM
2002
IEEE
14 years 19 days ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
We address the problem of shape based classification. We interpret the shape of an object as a probability distribution governing the location of the points of the object. An imag...