Sciweavers

2262 search results - page 149 / 453
» Points with large quadrant-depth
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
15 years 10 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
EURONGI
2008
Springer
15 years 8 months ago
Interference-Aware Channel Assignment in Wireless Mesh Networks
DED ABSTRACT The increased popularity and the growth in the number of deployed IEEE 802.11 Access Points (APs) have raised the opportunity to merge together various disjointed wire...
Rosario Giuseppe Garroppo, Stefano Giordano, David...
MVA
2000
164views Computer Vision» more  MVA 2000»
15 years 7 months ago
Visual Screen: Transforming an Ordinary Screen into a Touch Screen
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
Zhengyou Zhang, Ying Shan
PR
2006
83views more  PR 2006»
15 years 6 months ago
Optimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
Chao Sima, Edward R. Dougherty