Sciweavers

879 search results - page 46 / 176
» Kolmogorov Complexity and Model Selection
Sort
View
TSC
2008
91views more  TSC 2008»
13 years 10 months ago
Selective Querying for Adapting Web Service Compositions Using the Value of Changed Information
Web service composition (WSC) techniques assume that the parameters used to model the environment remain static and accurate throughout the composition's execution. However, W...
John Harney, Prashant Doshi
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 10 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
IDA
2009
Springer
14 years 4 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
SPAA
2010
ACM
13 years 10 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
DEBS
2008
ACM
13 years 11 months ago
A framework for performance evaluation of complex event processing systems
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques