Sciweavers

358 search results - page 66 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
127
Voted
CVPR
2008
IEEE
16 years 3 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
140
Voted
EAGC
2003
Springer
15 years 7 months ago
Automatic Services Discovery, Monitoring and Visualization of Grid Environments: The MapCenter Approach
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
Franck Bonnassieux, Robert Harakaly, Pascale Prime...
145
Voted
DFN
2003
15 years 3 months ago
High-Efficient Intrusion Detection Infrastructure
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
Thomas Holz, Michael Meier, Hartmut König
SIGGRAPH
1992
ACM
15 years 6 months ago
Re-tiling polygonal surfaces
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
Greg Turk
SIGCOMM
2006
ACM
15 years 7 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...