Sciweavers

1693 search results - page 72 / 339
» fast 2008
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 9 months ago
Fast Density Codes for Image Data
Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points...
Pierre Courrieu
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 10 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
RECONFIG
2008
IEEE
107views VLSI» more  RECONFIG 2008»
14 years 3 months ago
Fast Implementation of a Bio-inspired Model for Decentralized Gathering
In the context of the emergence of alternative computing resources to address the challenge of the upcoming end of Moore’s law, we consider the feasibility of gathering computat...
Bernard Girau, Cesar Torres-Huitzil
CNSR
2008
IEEE
130views Communications» more  CNSR 2008»
13 years 10 months ago
Could Proactive Link-State Routed Wireless Networks Benefit from Local Fast Reroute?
The communication performance in wireless networks is often heavily influenced by failures caused by node mobility and radio disturbance. Proactive linkstate routing protocols lik...
Audun Fosselie Hansen, Geir Egeland, Paal Engelsta...
SEFM
2008
IEEE
14 years 3 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...