Sciweavers

329 search results - page 4 / 66
» New lower bounds for some spherical designs
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 4 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 7 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
TROB
2002
112views more  TROB 2002»
13 years 7 months ago
SHaDe, a new 3-DOF haptic device
This paper presents a new type of haptic device using spherical geometry. The basic idea of haptic devices is to provide users with feedback information on the motion and/or force ...
Lionel Birglen, Clément Gosselin, Nicolas P...
FSTTCS
2001
Springer
13 years 12 months ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender