Sciweavers

1004 search results - page 135 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
COMPGEOM
2003
ACM
14 years 2 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
BMVC
2010
13 years 6 months ago
Background Modelling on Tensor Field for Foreground Segmentation
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
Rui Caseiro, Jorge Batista, Pedro Martins
MFCS
2009
Springer
14 years 1 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
PAMI
2007
202views more  PAMI 2007»
13 years 8 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ISSTA
2009
ACM
14 years 3 months ago
Identifying semantic differences in AspectJ programs
Program differencing is a common means of software debugging. Although many differencing algorithms have been proposed for procedural and object-oriented languages like C and Ja...
Martin Th Görg, Jianjun Zhao