675 search results - page 134 / 135 » On Compression of Parse Trees |
NOMS
2006
IEEE
14 years 1 months ago
2006
IEEE
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
ESA
1999
Springer
13 years 11 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
NETWORKING
2008
13 years 9 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...