Sciweavers

3396 search results - page 472 / 680
» Tree representations of graphs
Sort
View
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
15 years 6 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
CGF
1998
104views more  CGF 1998»
15 years 6 months ago
Animation of Biological Organ Growth Based on L-systems
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita
IPL
1998
119views more  IPL 1998»
15 years 6 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
15 years 5 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
ACL
2010
15 years 4 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein