Sciweavers

2168 search results - page 212 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
NIPS
1994
15 years 5 months ago
Active Learning with Statistical Models
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...
David A. Cohn, Zoubin Ghahramani, Michael I. Jorda...
PPOPP
2003
ACM
15 years 9 months ago
Compiler support for speculative multithreading architecture with probabilistic points-to analysis
Speculative multithreading (SpMT) architecture can exploit thread-level parallelism that cannot be identified statically. Speedup can be obtained by speculatively executing threa...
Peng-Sheng Chen, Ming-Yu Hung, Yuan-Shin Hwang, Ro...
238
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
126
Voted
NIPS
2001
15 years 6 months ago
Distribution of Mutual Information
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliabilit...
M. Hutter
EWSN
2004
Springer
16 years 4 months ago
Context-Aware Sensors
Wireless sensor networks typically consist of a large number of sensor nodes embedded in a physical space. Such sensors are low-power devices that are primarily used for monitoring...
Eiman Elnahrawy, Badri Nath