3894 search results - page 703 / 779 » Approximation Algorithms for Biclustering Problems |
297
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
124
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
167
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
114
click to vote
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
138
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...