Sciweavers

2374 search results - page 417 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
GIS
2007
ACM
15 years 10 months ago
High-level web service for 3D building information visualization and analysis
This paper presents an approach to visualize and analyze 3D building information models within virtual 3D city models. Building information models (BIMs) formalize and represent d...
Benjamin Hagedorn, Jürgen Döllner
IPSN
2007
Springer
15 years 3 months ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter
CVPR
2010
IEEE
15 years 3 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
CODES
2005
IEEE
15 years 3 months ago
High-level synthesis for large bit-width multipliers on FPGAs: a case study
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...
Gang Quan, James P. Davis, Siddhaveerasharan Devar...
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...