3894 search results - page 696 / 779 » Approximation Algorithms for Biclustering Problems |
154
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
121
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
106
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
128
click to vote
IMC
2007
ACM
15 years 4 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
137
click to vote
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...