Sciweavers

1265 search results - page 182 / 253
» Algorithms for Drawing Media
Sort
View
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 6 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
CEC
2009
IEEE
15 years 11 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
FOCS
2009
IEEE
15 years 11 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
CVPR
2009
IEEE
16 years 11 months ago
A Robust Approach for Automatic Registration of Aerial Images with Untextured Aerial LiDAR Data
Airborne LiDAR technology draws increasing interest in large-scale 3D urban modeling in recent years. 3D Li- DAR data typically has no texture information. To generate photo-rea...
Lu Wang, Ulrich Neumann
CVPR
2005
IEEE
16 years 6 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas