Sciweavers

675 search results - page 125 / 135
» On Compression of Parse Trees
Sort
View
ACL
2012
11 years 11 months ago
Large-Scale Syntactic Language Modeling with Treelets
We propose a simple generative, syntactic language model that conditions on overlapping windows of tree context (or treelets) in the same way that n-gram language models condition...
Adam Pauls, Dan Klein
ICIP
2003
IEEE
14 years 10 months ago
Rotation-invariant features based on steerable transforms with an application to distributed image classification
In this paper, we propose a new rotation-invariant image retrieval system based on steerable pyramids and the concept of angular alignment across scales. First, we define energy-b...
Baltasar Beferull-Lozano, Antonio Ortega, Hua Xie
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 1 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
DCC
1996
IEEE
14 years 23 days ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
CNIS
2006
13 years 10 months ago
Towards effective packet classification
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
Yaxuan Qi, Jun Li