Sciweavers

675 search results - page 135 / 135
» On Compression of Parse Trees
Sort
View
EUROIMSA
2006
151views Multimedia» more  EUROIMSA 2006»
13 years 7 months ago
A Framework for Transformations of XML within the Binary Domain
Since XML-formatted content and data is becoming the medium of communication par excellence on intranets and the Internet, the requirements to minimize the network load caused by ...
Wim Van Lancker, Robbie De Sutter, Davy De Schrijv...
WEBNET
1997
13 years 7 months ago
Beyond Java: An Infrastructure for High-Performance Mobile Code on the World Wide Web
: We are building an infrastructure for the platform-independent distribution and execution of high-performance mobile code as a future Internet technology to complement and perhap...
Michael Franz
TIT
2008
72views more  TIT 2008»
13 years 5 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
ICASSP
2011
IEEE
12 years 9 months ago
Rapid image retrieval for mobile location recognition
Recognizing the location and orientation of a mobile device from captured images is a promising application of image retrieval algorithms. Matching the query images to an existing...
Georg Schroth, Anas Al-Nuaimi, Robert Huitl, Flori...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu