Sciweavers

5100 search results - page 226 / 1020
» The Linear Complexity of a Graph
Sort
View
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
15 years 6 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
JVCIR
2006
140views more  JVCIR 2006»
15 years 6 months ago
Improved H.264 rate control by enhanced MAD-based frame complexity prediction
This paper presents a revised rate control scheme based on an improved frame complexity measure. Rate control adopted by both MPEG-4 VM18 and H.264/AVC use a quadratic rate-distor...
Xiaoquan Yi, Nam Ling
ICC
2007
IEEE
110views Communications» more  ICC 2007»
16 years 1 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
164
Voted
IPPS
2009
IEEE
16 years 1 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
COMPGEOM
2010
ACM
15 years 10 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh