Sciweavers

10608 search results - page 553 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
NIPS
2008
15 years 8 months ago
Learning Taxonomies by Dependence Maximization
We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the ...
Matthew B. Blaschko, Arthur Gretton
CEC
2010
IEEE
15 years 8 months ago
Global search for occlusion minimisation in virtual camera control
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
Paolo Burelli, Georgios N. Yannakakis
DAM
2007
105views more  DAM 2007»
15 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
COLOGNETWENTE
2010
15 years 5 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
DCG
2010
97views more  DCG 2010»
15 years 5 months ago
Cech Type Approach to Computing Homology of Maps
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
Marian Mrozek