Sciweavers

136 search results - page 15 / 28
» Succinct Representation of Labeled Graphs
Sort
View
LEGE
2004
103views Education» more  LEGE 2004»
13 years 9 months ago
Structuring and merging Distributed Content
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
Luca Stefanutti, Dietrich Albert, Cord Hockemeyer
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
NDSS
2008
IEEE
14 years 1 months ago
HookFinder: Identifying and Understanding Malware Hooking Behaviors
Installing various hooks into the victim system is an important attacking strategy employed by malware, including spyware, rootkits, stealth backdoors, and others. In order to def...
Heng Yin, Zhenkai Liang, Dawn Song
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
IWCIA
2004
Springer
14 years 27 days ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo