Sciweavers

255 search results - page 35 / 51
» A new upper bound for the bipartite Ramsey problem
Sort
View
CCCG
2003
15 years 7 months ago
The Gaussian Centre of a Set of Mobile Points
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
Stephane Durocher, David G. Kirkpatrick
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 11 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
QEST
2006
IEEE
16 years 3 days ago
Modeling Fiber Delay Loops in an All Optical Switch
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
Ana Busic, Mouad Ben Mamoun, Jean-Michel Fourneau
DCC
2009
IEEE
16 years 6 months ago
Compressed Kernel Perceptrons
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
Slobodan Vucetic, Vladimir Coric, Zhuang Wang
COMPGEOM
2006
ACM
16 years 2 days ago
Online geometric reconstruction
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
Bernard Chazelle, C. Seshadhri