Algorithms - ESA '95: Third Annual European Symposium, Corfu, Greece, September, 25 - 27, 1995. Proceedings, 3. sējumsPaul Spirakis Springer Science & Business Media, 1995. gada 13. sept. - 598 lappuses This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995. The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design. |
No grāmatas satura
1.–5. rezultāts no 26.
x. lappuse
... Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear - Time Cao An Wang , Francis Chin 280 Session 5. Chair : Hava Siegelmann External - Memory Algorithms for Processing Line Segments in Geographic Information ...
... Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear - Time Cao An Wang , Francis Chin 280 Session 5. Chair : Hava Siegelmann External - Memory Algorithms for Processing Line Segments in Geographic Information ...
239. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
240. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
242. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
246. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
I | 1 |
II | 17 |
IV | 31 |
V | 46 |
VI | 60 |
VII | 75 |
VIII | 89 |
IX | 102 |
XXX | 327 |
XXXI | 341 |
XXXII | 355 |
XXXIII | 369 |
XXXIV | 381 |
XXXV | 394 |
XXXVI | 409 |
XXXVII | 420 |
X | 113 |
XI | 128 |
XII | 142 |
XIII | 155 |
XIV | 171 |
XV | 185 |
XVI | 199 |
XVII | 213 |
XVIII | 227 |
XIX | 238 |
XX | 252 |
XXI | 264 |
XXII | 280 |
XXVI | 295 |
XXIX | 311 |
XXXVIII | 434 |
XXXIX | 448 |
XL | 460 |
XLI | 473 |
XLII | 484 |
XLIII | 494 |
XLIV | 508 |
XLV | 523 |
XLVII | 538 |
XLVIII | 554 |
XLIX | 570 |
LI | 582 |
597 | |
Bieži izmantoti vārdi un frāzes
approximation approximation algorithm assignment assume augmentation bandwidth biconnected binary search binomial transform block C-planar cell certificate color competitive ratio complexity Computer Science connected constant constraints construct contains cost cubes data structure decomposition define Delaunay triangulation deletion denote deterministic digraph disk dynamic edges efficient endpoints feasible function given graph G Hausdorff distance hot-potato routing inequality input integer intersection interval graph k-connected Kalmanson label Lemma linear load log log lower bound matrix Max Cut maximum minimum node NP-complete NP-hard O(log O(n² optimal packets pair Parallel Algorithms partition performance permutation Phase planar polynomial polytope PRAM preprocessing problem Proc processors programming Proof protocol queries random requests root routing Section sequence server shortest path simple polygon simulation solution solved step subgraph subset subtree Theorem tree treewidth triangulation update variables vector vertex vertices Voronoi diagram weight zonotope