Sciweavers

1333 search results - page 137 / 267
» Not a Number of Floating Point Problems
Sort
View
MST
2007
167views more  MST 2007»
15 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ICCV
2007
IEEE
16 years 1 months ago
Two-View Motion Segmentation by Mixtures of Dirichlet Process with Model Selection and Outlier Removal
This paper presents a novel motion segmentation algorithm on the basis of mixture of Dirichlet process (MDP) models, a kind of nonparametric Bayesian framework. In contrast to pre...
Yong-Dian Jian, Chu-Song Chen
DASFAA
2005
IEEE
120views Database» more  DASFAA 2005»
16 years 17 days ago
A New Indexing Method for High Dimensional Dataset
Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse...
Jiyuan An, Yi-Ping Phoebe Chen, Qinying Xu, Xiaofa...
WG
2010
Springer
15 years 5 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
SSPR
2004
Springer
16 years 8 days ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli