Sciweavers

284 search results - page 51 / 57
» What Matchings Can Be Stable
Sort
View
PODC
2009
ACM
14 years 10 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
AGENTS
2001
Springer
14 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
CVPR
2003
IEEE
14 years 11 months ago
Joint Manifold Distance: a new approach to appearance based clustering
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
Andrew W. Fitzgibbon, Andrew Zisserman
WWW
2009
ACM
14 years 4 months ago
A game based approach to assign geographical relevance to web images
Geographical context is very important for images. Millions of images on the Web have been already assigned latitude and longitude information. Due to the rapid proliferation of s...
Yuki Arase, Xing Xie, Manni Duan, Takahiro Hara, S...
ISCA
2009
IEEE
180views Hardware» more  ISCA 2009»
14 years 4 months ago
Decoupled DIMM: building high-bandwidth memory system using low-speed DRAM devices
The widespread use of multicore processors has dramatically increased the demands on high bandwidth and large capacity from memory systems. In a conventional DDR2/DDR3 DRAM memory...
Hongzhong Zheng, Jiang Lin, Zhao Zhang, Zhichun Zh...