Sciweavers

18306 search results - page 283 / 3662
» Algorithmics in Exponential Time
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
WWW
2007
ACM
16 years 7 months ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su
164
Voted
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 7 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 7 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson