Sciweavers

291 search results - page 32 / 59
» Approximate centerpoints with proofs
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 2 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 10 months ago
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
Frédéric Mazoit
ENDM
2008
80views more  ENDM 2008»
13 years 10 months ago
Polytopal complexes: maps, chain complexes and... necklaces
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
Frédéric Meunier
IPL
2008
90views more  IPL 2008»
13 years 10 months ago
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple rin...
Behrooz Parhami
JCSS
2006
89views more  JCSS 2006»
13 years 10 months ago
Ramsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Yair Bartal, Béla Bollobás, Manor Me...