340 search results - page 61 / 68 » Clustering with Lower Bound on Similarity |
106
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
95
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
101
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Unsupervised categorization of images or image parts is often needed for image and video summarization or as a preprocessing step in supervised methods for classification, trackin...
BMCBI
2010
15 years 23 days ago
2010
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
123
click to vote
MOBICOM
2003
ACM
15 years 6 months ago
2003
ACM
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...