823 search results - page 78 / 165 » Brick partitions of graphs |
210
click to vote
NIPS
2008
15 years 7 months ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
205
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
149
click to vote
FSTTCS
2007
Springer
16 years 10 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
332
click to vote
CSL
2011
Springer
15 years 1 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
176
click to vote
ICCS
2009
Springer
16 years 22 days ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...