Sciweavers

5210 search results - page 420 / 1042
» Exact geometric computation
Sort
View
IDA
2007
Springer
15 years 6 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
QUESTA
2006
87views more  QUESTA 2006»
15 years 6 months ago
Mean value analysis for polling systems
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute t...
Erik M. M. Winands, Ivo J. B. F. Adan, G. J. van H...
TIT
2008
82views more  TIT 2008»
15 years 6 months ago
ZRM Codes
Abstract. Quaternary Z RM (r,m) codes were defined to study the Z4-linearity of ReedMuller codes. In the literature two different definitions of such codes can be found, denoted Z ...
Joaquim Borges, Cristina Fernández-Có...
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
15 years 6 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
COR
2008
133views more  COR 2008»
15 years 6 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...