Sciweavers

4791 search results - page 596 / 959
» Clustering with partial information
Sort
View
SOSP
2009
ACM
16 years 4 months ago
PRES: probabilistic replay with execution sketching on multiprocessors
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
Soyeon Park, Yuanyuan Zhou, Weiwei Xiong, Zuoning ...
CIKM
2009
Springer
16 years 2 months ago
Mining linguistic cues for query expansion: applications to drug interaction search
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
Sheng Guo, Naren Ramakrishnan
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
16 years 1 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
16 years 1 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
16 years 12 days ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...