Sciweavers

792 search results - page 91 / 159
» Measuring complexity by measuring structure and organization
Sort
View
COMPGEOM
2003
ACM
15 years 6 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
IWPC
1996
IEEE
15 years 5 months ago
A Formal Architectural Design Patterns-Based Approach to Software Understanding
Mastering the complexity of programs and systems, particularly distributed systems, should lead to signi cant improvements in program and system understanding. In this paper we pr...
Paulo S. C. Alencar, Donald D. Cowan, Thomas Kunz,...
NIPS
2008
15 years 3 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
CCCG
2004
15 years 3 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
MTA
2008
150views more  MTA 2008»
15 years 1 months ago
Evaluation and monitoring of video quality for UMA enabled video streaming systems
This paper1 deals with monitoring user perception of multimedia presentations in a Universal Multimedia Access (UMA) enabled system using objective no-reference (NR) metrics. Thes...
R. Venkatesh Babu, Andrew Perkis, Odd Inge Hillest...