Sciweavers

831 search results - page 75 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
SIGCOMM
2010
ACM
13 years 10 months ago
Data center TCP (DCTCP)
Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today&...
Mohammad Alizadeh, Albert G. Greenberg, David A. M...
ICPR
2008
IEEE
14 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
CIKM
2008
Springer
14 years 8 days ago
Tag data and personalized information retrieval
Researchers investigating personalization techniques for Web Information Retrieval face a challenge; that the data required to perform evaluations, namely query logs and clickthro...
Mark James Carman, Mark Baillie, Fabio Crestani
ML
2002
ACM
100views Machine Learning» more  ML 2002»
13 years 10 months ago
Structure in the Space of Value Functions
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
David J. Foster, Peter Dayan
VLDB
2002
ACM
166views Database» more  VLDB 2002»
13 years 10 months ago
COMA - A System for Flexible Combination of Schema Matching Approaches
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
Hong Hai Do, Erhard Rahm