Sciweavers

9949 search results - page 1919 / 1990
» On the Network Complexity of Selection
Sort
View
POPL
2007
ACM
14 years 9 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 9 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 9 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 9 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
WISE
2009
Springer
14 years 6 months ago
Start Trusting Strangers? Bootstrapping and Prediction of Trust
Web-based environments typically span interactions between humans and software services. The management and automatic calculation of trust are among the key challenges of the futur...
Florian Skopik, Daniel Schall, Schahram Dustdar
« Prev « First page 1919 / 1990 Last » Next »