1952 search results - page 215 / 391 » Complete partitions of graphs |
199
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
162
click to vote
ISMIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
213
click to vote
SPIRE
2005
Springer
16 years 1 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
168
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
181
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...