Sciweavers

2492 search results - page 324 / 499
» On the General Signature Trees
Sort
View
DMSN
2004
ACM
15 years 11 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
MM
2004
ACM
78views Multimedia» more  MM 2004»
15 years 11 months ago
Indexing and matching of polyphonic songs for query-by-singing system
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database...
Tat-Wan Leung, Chong-Wah Ngo
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 11 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
ASIACRYPT
2004
Springer
15 years 11 months ago
Higher Order Universal One-Way Hash Functions
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
Deukjo Hong, Bart Preneel, Sangjin Lee
GLVLSI
2003
IEEE
239views VLSI» more  GLVLSI 2003»
15 years 11 months ago
A novel 32-bit scalable multiplier architecture
In this paper, we present a novel hybrid multiplier architecture that has the regularity of linear array multipliers and the performance of tree multipliers and is highly scalable...
Yeshwant Kolla, Yong-Bin Kim, John Carter