Sciweavers

10412 search results - page 1611 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 7 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
POPL
2008
ACM
16 years 7 months ago
Demand-driven alias analysis for C
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
Xin Zheng, Radu Rugina
POPL
2005
ACM
16 years 7 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
« Prev « First page 1611 / 2083 Last » Next »