Sciweavers

6756 search results - page 1024 / 1352
» The Structure of Visual Spaces
Sort
View
SOFSEM
2007
Springer
16 years 27 days ago
A Simple Algorithm for Stable Minimum Storage Merging
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
Pok-Son Kim, Arne Kutzner
SPIRE
2007
Springer
16 years 27 days ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
159
Voted
DATE
2006
IEEE
93views Hardware» more  DATE 2006»
16 years 25 days ago
Restructuring field layouts for embedded memory systems
In many computer systems with large data computations, the delay of memory access is one of the major performance bottlenecks. In this paper, we propose an enhanced field remappi...
Keoncheol Shin, Jungeun Kim, Seonggun Kim, Hwansoo...
GLOBECOM
2006
IEEE
16 years 25 days ago
Adaptive Learning of Transmission Control Policies for MIMO Fading Channels under Delay Constraint
— This paper addresses learning based adaptive resource allocation for wireless MIMO channels with Markovian fading. The problem is posed as Constrained Markov Decision Process w...
Dejan V. Djonin, Vikram Krishnamurthy
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 25 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
« Prev « First page 1024 / 1352 Last » Next »