Sciweavers

13456 search results - page 2589 / 2692
» Design and Development in the
Sort
View
GIS
2009
ACM
14 years 2 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
KDD
2009
ACM
224views Data Mining» more  KDD 2009»
14 years 2 months ago
Issues in evaluation of stream learning algorithms
Learning from data streams is a research area of increasing importance. Nowadays, several stream learning algorithms have been developed. Most of them learn decision models that c...
João Gama, Raquel Sebastião, Pedro P...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
DEXA
2001
Springer
151views Database» more  DEXA 2001»
14 years 2 months ago
Cache Conscious Clustering C3
The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of o...
Zhen He, Alonso Marquez
DIGITALCITIES
2001
Springer
14 years 2 months ago
Little Boxes, Glocalization, and Networked Individualism
Much thinking about digital cities is in terms of community groups. Yet, the world is composed of social networks and not of groups. This paper traces how communities have changed ...
Barry Wellman
« Prev « First page 2589 / 2692 Last » Next »