Sciweavers

2304 search results - page 335 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 3 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
ISMAR
2003
IEEE
15 years 3 months ago
Hybrid Indoor and Outdoor Tracking for Mobile 3D Mixed Reality
This paper describes a new hybrid tracking system that integrates standard outdoor augmented reality trackers with a low cost indoor tracker based on the use of fiducial markers. ...
Wayne Piekarski, Ben Avery, Bruce H. Thomas, Pierr...
SCAM
2003
IEEE
15 years 3 months ago
Online Cycle Detection and Difference Propagation for Pointer Analysis
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
David J. Pearce, Paul H. J. Kelly, Chris Hankin
GBRPR
2003
Springer
15 years 3 months ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
IMR
2003
Springer
15 years 3 months ago
When and Why Ruppert's Algorithm Works
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
Gary L. Miller, Steven E. Pav, Noel Walkington