159 search results - page 18 / 32 » Computing minimum cuts by randomized search heuristics |
120
click to vote
KDD
2009
ACM
16 years 29 days ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
86
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
106
click to vote
CIBCB
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
76
Voted
ECCV
2004
Springer
16 years 2 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
105
Voted
AINA
2009
IEEE
15 years 7 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...