Sciweavers

199 search results - page 36 / 40
» A Method for Selecting the Bin Size of a Time Histogram
Sort
View
SIGIR
2004
ACM
14 years 1 months ago
On scaling latent semantic indexing for large peer-to-peer systems
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...
Chunqiang Tang, Sandhya Dwarkadas, Zhichen Xu
GLVLSI
2003
IEEE
130views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Zero overhead watermarking technique for FPGA designs
FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing w...
Adarsh K. Jain, Lin Yuan, Pushkin R. Pari, Gang Qu
VIS
2007
IEEE
101views Visualization» more  VIS 2007»
14 years 9 months ago
Random-Accessible Compressed Triangle Meshes
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a r...
Sung-Eui Yoon, Peter Lindstrom
BMCBI
2010
175views more  BMCBI 2010»
13 years 7 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...