Sciweavers

2127 search results - page 140 / 426
» Computing large matchings fast
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...
HPCA
1997
IEEE
15 years 8 months ago
ATM and Fast Ethernet Network Interfaces for User-Level Communication
Fast Ethernet and ATM are two attractive network technologies for interconnecting workstation clusters for parallel and distributed computing. This paper compares network interfac...
Matt Welsh, Anindya Basu, Thorsten von Eicken
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
15 years 11 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
DS
1997
117views Database» more  DS 1997»
15 years 5 months ago
Experience with a Combined Approach to Attribute-Matching Across Heterogeneous Databases
Determining attribute correspondences is a difficult, time-consuming, knowledge-intensive part of database integration. We report on experiences with tools that identified candi...
Chris Clifton, E. Housman, Arnon Rosenthal
CODES
2005
IEEE
15 years 9 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...