Sciweavers

10633 search results - page 2031 / 2127
» Relating Distributed Objects
Sort
View
AAAI
2012
12 years 13 days ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
GIS
2004
ACM
14 years 11 months ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 4 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
ISPA
2005
Springer
14 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
BMCBI
2007
168views more  BMCBI 2007»
13 years 10 months ago
Advancing translational research with the Semantic Web
Background: A fundamental goal of the U.S. National Institute of Health (NIH) "Roadmap" is to strengthen Translational Research, defined as the movement of discoveries i...
Alan Ruttenberg, Tim Clark, William Bug, Matthias ...
« Prev « First page 2031 / 2127 Last » Next »