290 search results - page 45 / 58 » Local Partitioning for Directed Graphs Using PageRank |
116
Voted
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
143
click to vote
AAAI
2007
15 years 4 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
170
click to vote
ICCV
1999
IEEE
16 years 3 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
156
click to vote
SGP
2004
15 years 4 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
159
Voted
VLSM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...