Sciweavers

2783 search results - page 264 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
153
Voted
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 4 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
143
Voted
CVPR
2012
IEEE
13 years 4 months ago
Bag of textons for image segmentation via soft clustering and convex shift
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...
Zhiding Yu, Ang Li, Oscar C. Au, Chunjing Xu
212
Voted
SPAA
2012
ACM
13 years 4 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
TEC
2012
197views Formal Methods» more  TEC 2012»
13 years 4 months ago
Improving Generalization Performance in Co-Evolutionary Learning
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
Siang Yew Chong, Peter Tino, Day Chyi Ku, Xin Yao
159
Voted
SDM
2012
SIAM
208views Data Mining» more  SDM 2012»
13 years 4 months ago
Mining Massive Archives of Mice Sounds with Symbolized Representations
Many animals produce long sequences of vocalizations best described as “songs.” In some animals, such as crickets and frogs, these songs are relatively simple and repetitive c...
Jesin Zakaria, Sarah Rotschafer, Abdullah Mueen, K...