Sciweavers

697 search results - page 72 / 140
» Approximation of Information Granule Sets
Sort
View
DCC
2007
IEEE
14 years 10 months ago
Nonuniform Compression in Databases with Haar Wavelet
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
S. Chen, A. Nucci
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
14 years 8 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
CVPR
2010
IEEE
14 years 7 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 5 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
ATAL
2008
Springer
14 years 1 months ago
Sequential decision making in repeated coalition formation under uncertainty
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
Georgios Chalkiadakis, Craig Boutilier