Sciweavers

1170 search results - page 164 / 234
» How Fast Is Too Fast
Sort
View
MICRO
2005
IEEE
107views Hardware» more  MICRO 2005»
15 years 8 months ago
Stream Programming on General-Purpose Processors
— In this paper we investigate mapping stream programs (i.e., programs written in a streaming style for streaming architectures such as Imagine and Raw) onto a general-purpose CP...
Jayanth Gummaraju, Mendel Rosenblum
GRAPHITE
2005
ACM
15 years 8 months ago
View-dependent tetrahedral meshing and rendering
We present a meshing and rendering framework for tetrahedral meshes that constructs a multi-resolution representation and uses this representation to adapt the mesh to rendering p...
Ralf Sondershaus, Wolfgang Straßer
CIKM
2005
Springer
15 years 8 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
ICALP
2005
Springer
15 years 8 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
MFCS
2005
Springer
15 years 8 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse