Sciweavers

1458 search results - page 201 / 292
» Monads for incremental computing
Sort
View
119
Voted
VLSID
2005
IEEE
128views VLSI» more  VLSID 2005»
16 years 4 months ago
On-Line Synthesis for Partially Reconfigurable FPGAs
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
Renqiu Huang, Ranga Vemuri
119
Voted
DCC
2007
IEEE
16 years 3 months ago
Spectral Predictors
Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done usin...
Lorenzo Ibarria, Peter Lindstrom, Jarek Rossignac
CVPR
2010
IEEE
15 years 12 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
Practical quad mesh simplification
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniel...
135
Voted
ICIDS
2009
Springer
15 years 10 months ago
Controlling Narrative Generation with Planning Trajectories: The Role of Constraints
Abstract. AI planning has featured in a number of Interactive Storytelling prototypes: since narratives can be naturally modelled as a sequence of actions it has been possible to e...
Julie Porteous, Marc Cavazza