Sciweavers

1732 search results - page 21 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade
JCO
2007
65views more  JCO 2007»
15 years 5 months ago
Group testing in graphs
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
Justie Su-tzu Juan, Gerard J. Chang
APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
15 years 8 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh
IJACTAICIT
2010
175views more  IJACTAICIT 2010»
15 years 3 months ago
Achieving CMMI Maturity Level 3 by Implementing FEAF Reference Models
The basic purpose of an Enterprise Architecture project is creating integrity among different enterprise components, including processes, systems, technologies, and etc. While CMM...
Fatemeh Kafili Kasmaee, Ramin Nassiri, Gholamreza ...
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
15 years 9 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...