Sciweavers

248 search results - page 1 / 50
» Using structure indices for efficient approximation of netwo...
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
ECAI
2008
Springer
13 years 6 months ago
An Analysis of Bayesian Network Model-Approximation Techniques
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
Adamo Santana, Gregory M. Provan
DEXA
2004
Springer
159views Database» more  DEXA 2004»
13 years 8 months ago
Adaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to informati...
Stéphane Bressan, Achmad Nizar Hidayanto, C...
3DIM
2003
IEEE
13 years 8 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
GLOBECOM
2008
IEEE
13 years 4 months ago
Influence of Node Location Distributions on the Structure of Ad Hoc and Mesh Networks
We study the impact of the distribution of node locations on key properties of wireless networks. In particular, using Monte Carlo simulations we study in detail the behavior of av...
Janne Riihijärvi, Marina Petrova, Petri M&aum...