Sciweavers

2095 search results - page 121 / 419
» Improved pebbling bounds
Sort
View
EJC
2008
15 years 1 months ago
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Sto...
JGT
2008
107views more  JGT 2008»
15 years 1 months ago
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
János Pach, Micha Sharir
91
Voted
ICIP
2009
IEEE
16 years 2 months ago
New Results On Performance Analysis Of Super-resolution Image Reconstruction
In this paper, we present new results in performance analysis of super-resolution (SR) image reconstruction. We investigate bounds on the improvement in resolution that can be ach...
93
Voted
ICML
2009
IEEE
16 years 1 months ago
The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
Carlos Diuk, Lihong Li, Bethany R. Leffler
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
15 years 6 months ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...