Sciweavers

2432 search results - page 468 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
CVPR
2009
IEEE
2115views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Real-Time O(1) Bilateral Filtering
We propose a new bilateral filtering algorithm with computational complexity invariant to filter kernel size, socalled O(1) or constant time in the literature. By showing that a...
Kar-Han Tan, Narendra Ahuja, Qingxiong Yang
79
Voted
AISB
1994
Springer
15 years 1 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
MIDDLEWARE
2004
Springer
15 years 3 months ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
EDBT
2004
ACM
143views Database» more  EDBT 2004»
15 years 9 months ago
OGSA-DQP: A Service for Distributed Querying on the Grid
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...
M. Nedim Alpdemir, Arijit Mukherjee, Anastasios Go...
STACS
2007
Springer
15 years 3 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis