Sciweavers

2801 search results - page 193 / 561
» On the Adequateness of the Connection Method
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Relating reinforcement learning performance to classification performance
We prove a quantitative connection between the expected sum of rewards of a policy and binary classification performance on created subproblems. This connection holds without any ...
John Langford, Bianca Zadrozny
WWW
2008
ACM
16 years 7 months ago
Low-load server crawler: design and evaluation
This paper proposes a method of crawling Web servers connected to the Internet without imposing a high processing load. We are using the crawler for a field survey of the digital ...
Katsuko T. Nakahira, Tetsuya Hoshino, Yoshiki Mika...
INFOCOM
2009
IEEE
16 years 1 months ago
A Measurement Based Rogue AP Detection Scheme
—This paper considers a category of rogue access points (APs) that pretend to be legitimate APs to lure users to connect to them. We propose a practical timing based technique th...
Hao Han, Bo Sheng, Chee Wei Tan, Qun Li, Sanglu Lu
DIAGRAMS
2004
Springer
15 years 12 months ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud
SEMWEB
2004
Springer
15 years 12 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez