Sciweavers

22588 search results - page 4436 / 4518
» On simulation model complexity
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 10 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 10 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
ISVC
2009
Springer
15 years 10 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
SEMWEB
2009
Springer
15 years 10 months ago
Semantically Enabled Temporal Reasoning in a Virtual Observatory
The Virtual Solar-Terrestrial Observatory (VSTO) is a distributed, scalable education and research environment for searching, integrating, and analyzing observational, experimental...
Patrick West, Eric Rozell, Stephan Zednik, Peter F...
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 10 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
« Prev « First page 4436 / 4518 Last » Next »