Sciweavers

321 search results - page 24 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Time domain reconstruction of spatial sound fields using compressed sensing
A novel technique for time domain spatial sound reproduction using compressed sensing is presented. The presented technique is based on the application of compressed sensing theor...
Andrew Wabnitz, Nicolas Epain, André van Sc...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
13 years 9 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
ICIP
1998
IEEE
14 years 9 months ago
A Compressed Video Database Structured for Active Browsing and Search
We describe a unique system called ViBE (video browsing environment) for browsing and searching large databases of video sequences. The system first computes the DC sequence for a...
Cüneyt M. Taskiran, Charles A. Bouman, Edward...
BMCBI
2010
145views more  BMCBI 2010»
13 years 7 months ago
JCoDA: a tool for detecting evolutionary selection
Background: The incorporation of annotated sequence information from multiple related species in commonly used databases (Ensembl, Flybase, Saccharomyces Genome Database, Wormbase...
Steven N. Steinway, Ruth Dannenfelser, Christopher...