Sciweavers

1403 search results - page 94 / 281
» Set cover algorithms for very large datasets
Sort
View
IJCM
2007
205views more  IJCM 2007»
15 years 4 months ago
BTF modelling using BRDF texels
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
Jirí Filip, Michal Haindl
AAAI
2007
15 years 6 months ago
Single Document Summarization with Document Expansion
Existing methods for single document summarization usually make use of only the information contained in the specified document. This paper proposes the technique of document expa...
Xiaojun Wan, Jianwu Yang
EDBT
2006
ACM
113views Database» more  EDBT 2006»
15 years 6 months ago
Deferred Maintenance of Disk-Based Random Samples
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
Rainer Gemulla, Wolfgang Lehner
IJCAI
1989
15 years 5 months ago
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known r...
Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. To...
INFOCOM
2009
IEEE
15 years 11 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...