Sciweavers

5350 search results - page 829 / 1070
» Space and time in eco-ontologies
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
SPAA
2009
ACM
15 years 11 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
CIKM
2009
Springer
15 years 11 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
15 years 11 months ago
TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing stateful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, t...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi
210
Voted
GIS
2009
ACM
15 years 11 months ago
A multidimensional model representing continuous fields in spatial data warehouses
Data warehouses and On-Line Analytical Processing (OLAP) provide an analysis framework supporting the decision making process. In many application domains, complex analysis tasks ...
Alejandro A. Vaisman, Esteban Zimányi