Sciweavers

1623 search results - page 200 / 325
» No Sorting
Sort
View
188
Voted
LATIN
2010
Springer
16 years 1 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
16 years 1 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
SI3D
2009
ACM
16 years 1 months ago
Hair self shadowing and transparency depth ordering using occupancy maps
This paper presents a method for quickly constructing a highquality approximate visibility function for high frequency semitransparent geometry such as hair. We can then reconstru...
Erik Sintorn, Ulf Assarsson
CEC
2009
IEEE
16 years 1 months ago
The Pareto-Following Variation Operator as an alternative approximation model
— This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA)...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
ICASSP
2009
IEEE
16 years 1 months ago
An efficient and robust method for detecting copy-move forgery
Copy-move forgery is a specific type of image tampering, where a part of the image is copied and pasted on another part of the same image. In this paper, we propose a new approac...
Sevinc Bayram, Husrev T. Sencar, Nasir D. Memon