Sciweavers

1977 search results - page 194 / 396
» The satisfactory partition problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
INFOCOM
2012
IEEE
13 years 9 months ago
Robust topology control in multi-hop cognitive radio networks
—The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance m...
Jing Zhao, Guohong Cao
MATES
2009
Springer
16 years 1 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
CVPR
2000
IEEE
16 years 8 months ago
Discriminant-EM Algorithm with Application to Image Retrieval
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
Ying Wu, Qi Tian, Thomas S. Huang
ICSE
2007
IEEE-ACM
16 years 6 months ago
A Future for Software Engineering?
This paper suggests the need for a software engineering research community conversation about the future that the community would like to have. The paper observes that the researc...
Leon J. Osterweil