Sciweavers

3096 search results - page 496 / 620
» Theory and Use of the EM Algorithm
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 27 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
COR
2008
122views more  COR 2008»
13 years 9 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
SAC
2008
ACM
13 years 8 months ago
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...
Joel E. Denny, Brian A. Malloy
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 4 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 11 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi