675 search results - page 118 / 135 » On Compression of Parse Trees |
CIAC
2006
Springer
14 years 11 days ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
CAGD
2005
13 years 8 months ago
2005
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
CL
2000
Springer
13 years 8 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
PRL
1998
13 years 8 months ago
1998
In this paper, we present a new approach for encrypting binary images. Putting different scan patterns at the same level in Ž .the scan tree structure and employing a two-dimensi...