Sciweavers

500 search results - page 27 / 100
» Approximation algorithms for maximum independent set of pseu...
Sort
View
BMVC
2001
15 years 4 months ago
An EM-like Algorithm for Motion Segmentation via Eigendecomposition
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...
Antonio Robles-Kelly, Edwin R. Hancock
118
Voted
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
15 years 8 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 5 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
SSPR
2004
Springer
15 years 7 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
WAIM
2007
Springer
15 years 7 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...