Sciweavers

2031 search results - page 124 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CASES
2006
ACM
15 years 1 months ago
Incremental elaboration for run-time reconfigurable hardware designs
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
Arran Derbyshire, Tobias Becker, Wayne Luk
MICCAI
2000
Springer
15 years 1 months ago
Nonrigid Registration of 3D Scalar, Vector and Tensor Medical Data
New medical imaging modalities offering multi-valued data, such as phase contrast MRA and diffusion tensor MRI, require general representations for the development of automatized a...
Juan Ruiz-Alzola, Carl-Fredrik Westin, Simon K. Wa...
CIKM
2009
Springer
15 years 1 months ago
Mining data streams with periodically changing distributions
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....
Yingying Tao, M. Tamer Özsu
3DOR
2008
15 years 11 days ago
Part Analogies in Sets of Objects
Shape retrieval can benefit from analogies among similar shapes and parts of different objects. By partitioning an object to meaningful parts and finding analogous parts in other ...
Shy Shalom, Lior Shapira, Ariel Shamir, Daniel Coh...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
14 years 11 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...