1542 search results - page 198 / 309 » The metamathematics of random graphs |
139
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
152
click to vote
MIR
2006
ACM
15 years 7 months ago
2006
ACM
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...
130
click to vote
WEBI
2005
Springer
15 years 7 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
132
click to vote
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
103
click to vote
HIPEAC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...