Sciweavers

537 search results - page 52 / 108
» A new upper bound for 3-SAT
Sort
View
IDA
2007
Springer
14 years 10 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 10 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ORDER
2011
14 years 4 months ago
Order Types of Convex Bodies
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...
Alfredo Hubard, Luis Montejano, Emiliano Mora, And...
AUTOMATICA
2005
152views more  AUTOMATICA 2005»
14 years 10 months ago
Identification of dynamical systems with a robust interval fuzzy model
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
Igor Skrjanc, Saso Blazic, Osvaldo E. Agamennoni
FOCS
1995
IEEE
15 years 1 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth