Sciweavers

1561 search results - page 253 / 313
» Probability Theory on IF Events
Sort
View
ECCC
2008
122views more  ECCC 2008»
14 years 10 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ENTCS
2008
120views more  ENTCS 2008»
14 years 10 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
EOR
2006
74views more  EOR 2006»
14 years 9 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg
IIE
2006
101views more  IIE 2006»
14 years 9 months ago
Random Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
Gordon V. Cormack
JMLR
2006
103views more  JMLR 2006»
14 years 9 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko