2254 search results - page 169 / 451 » Computing the minimal covering set |
166
click to vote
MICCAI
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...
172
click to vote
CIAC
2010
Springer
16 years 4 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
159
click to vote
CIARP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
174
click to vote
BDA
2007
15 years 8 months ago
2007
The paper presents a complete framework for spatial indexing support in a distributed setting. We consider a shared-nothing environment where a set of servers provides independent...
141
click to vote
JEI
2006
15 years 6 months ago
2006
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...