Sciweavers

484 search results - page 74 / 97
» The number of convex permutominoes
Sort
View
IPPS
1999
IEEE
14 years 2 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
COLT
1999
Springer
14 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
CSE
2009
IEEE
14 years 2 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
DCG
2007
67views more  DCG 2007»
13 years 10 months ago
Note on an Inequality of Wegner
G. Wegner [12] gave a geometric characterization of all so–called Groemer packing of n ≥ 2 unit discs in E2 that are densest packings of n unit discs with respect to the conve...
Károly J. Böröczky, Imre Z. Ruzsa
ORDER
2006
97views more  ORDER 2006»
13 years 10 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...