Sciweavers

970 search results - page 100 / 194
» case 2011
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
MMAS
2011
Springer
13 years 1 months ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying
ICCV
2011
IEEE
12 years 10 months ago
A 3D Laplacian-Driven Parametric Deformable Model
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...
ASUNAM
2011
IEEE
12 years 10 months ago
Multi-relational Link Prediction in Heterogeneous Information Networks
Abstract—Many important real-world systems, modeled naturally as complex networks, have heterogeneous interactions and complicated dependency structures. Link prediction in such ...
Darcy A. Davis, Ryan Lichtenwalter, Nitesh V. Chaw...
CADE
2011
Springer
12 years 10 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...