1469 search results - page 182 / 294 » Approximate polynomial decomposition |
240
Voted
SWAT
2010
Springer
16 years 17 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
212
Voted
APPT
2005
Springer
16 years 1 months ago
2005
Springer
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
202
click to vote
CDC
2009
IEEE
2009
IEEE
Robust stabilization of model-based uncertain singularly perturbed systems with networked time-delay
16 years 7 days ago
—In this paper, a robust stabilization of the uncertain singularly perturbed system via a networked state feedback with the transmission time-delay is addressed. Taking its nomin...
241
click to vote
MOBICOM
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
243
Voted
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...