Sciweavers

2283 search results - page 84 / 457
» Bounds of Graph Characteristics
Sort
View
CPC
2008
51views more  CPC 2008»
13 years 8 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich
DM
1999
101views more  DM 1999»
13 years 7 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...
ICML
2000
IEEE
14 years 8 months ago
Bounds on the Generalization Performance of Kernel Machine Ensembles
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
Luis Pérez-Breva, Massimiliano Pontil, Theo...
CHARME
1993
Springer
68views Hardware» more  CHARME 1993»
14 years 2 days ago
Temporal Analysis of Time Bounded Digital Systems
To perform veri cation of digital systems with time bounded delays, it is essential to characterize the space of all possible system behaviors. In this paper, we describe our analy...
Alan R. Martello, Steven P. Levitan
ICIP
2010
IEEE
13 years 6 months ago
Learning denoising bounds for noisy images
In [1], we derived an expression for the fundamental limit to image denoising assuming that the noise-free image is available. In this paper, we propose an estimator for the bound...
Priyam Chatterjee, Peyman Milanfar