Sciweavers

11151 search results - page 2130 / 2231
» On the Complexity of Model Expansion
Sort
View
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 7 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
116
Voted
ISVC
2009
Springer
15 years 7 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
124
Voted
SEMWEB
2009
Springer
15 years 7 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...
100
Voted
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 7 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...
122
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
« Prev « First page 2130 / 2231 Last » Next »