Sciweavers

1722 search results - page 202 / 345
» On the sample mean of graphs
Sort
View
TCS
2010
15 years 4 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
ECCV
2004
Springer
16 years 8 months ago
A Bayesian Framework for Multi-cue 3D Object Tracking
This paper presents a Bayesian framework for multi-cue 3D object tracking of deformable objects. The proposed spatio-temporal object representation involves a set of distinct linea...
Jan Giebel, Dariu Gavrila, Christoph Schnörr
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
COMPLEX
2009
Springer
16 years 1 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
ISVC
2007
Springer
16 years 20 days ago
Blur in Human Vision and Increased Visual Realism in Virtual Environments
Abstract. A challenge for virtual reality (VR) applications is to increase the realism of an observer’s visual experience. For this purpose the variation of the blur an observer ...
Michael S. Bittermann, I. Sevil Sariyildiz, Ö...