Sciweavers

2152 search results - page 117 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
127
Voted
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 8 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
DIS
2006
Springer
15 years 7 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
DATAMINE
2006
157views more  DATAMINE 2006»
15 years 4 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz
134
Voted
IJSWIS
2008
135views more  IJSWIS 2008»
15 years 4 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
162
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Optimal Control of Wireless Networks with Finite Buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achie...
Long Bao Le, Eytan Modiano, Ness B. Shroff