Sciweavers

851 search results - page 128 / 171
» Random constructions and density results
Sort
View
WWW
2005
ACM
15 years 10 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
CORR
2008
Springer
145views Education» more  CORR 2008»
14 years 10 months ago
The Capacity Region of Large Wireless Networks
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
Urs Niesen, Piyush Gupta, Devavrat Shah
TPDS
2008
136views more  TPDS 2008»
14 years 10 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
14 years 9 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron