Results 51 to 60 of about 2,350 (110)
LOGLOG counting for the estimation of IP traffic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper, we discuss the problem of estimating the number of "elephants'' in a stream of IP packets. First, the problem is formulated in the context of multisets.
Olivier Gandouet, Alain Jean-Marie
doaj +1 more source
How to advance general game playing artificial intelligence by player modelling [PDF]
, 2016 7 pagesGeneral game playing artificial intelligence has recently seen important advances due to the various techniques known as 'deep learning'.
Cowley, Benjamin Ultan
core +1 more source
Complete k-ary trees and generalized meta-Fibonacci sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that a family of generalized meta-Fibonacci sequences arise when counting the number of leaves at the largest level in certain infinite sequences of k-ary trees and restricted compositions of an integer.
Chris Deugau, Frank Ruskey
doaj +1 more source
Contextual consent: ethical mining of social media for health research [PDF]
, 2017 Social media are a rich source of insight for data mining and user centred research, but the question of consent arises when studying such data without the express knowledge of the creator. Case studies that mine social data from users of online services
Henderson, Tristan, Norval, Christopher
core +1 more source
The Lyapunov tortoise and the dyadic hare [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study a gcd algorithm directed by Least Significant Bits, the so―called LSB algorithm, and provide a precise average―case analysis of its main parameters [number of iterations, number of shifts, etc...].
Benoît Daireaux +2 more
doaj +1 more source
User Preferences of Spatio-Temporal Referencing Approaches For Immersive 3D Radar Charts
, 2023 The use of head-mounted display technologies for virtual reality experiences is inherently single-user-centred, allowing for the visual immersion of its user in the computer-generated environment.
Alissandrakis, Aris +2 more
core
Cache efficient simple dynamic programming [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's context-free language recognition algorithm are designed, implemented, analyzed, and empirically evaluated with timing studies and cache simulations.
Cary Cherng, Richard E. Ladner
doaj +1 more source
Refinding is Not Finding Again [PDF]
, 2005 A challenging problem for Internet users today is how to refind information that they have seen before. We believe that finding and refinding are different user activities and require different types of support.
Capra, Robert +2 more
core
On undecidability of equicontinuity classification for cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Equicontinuity classification is a popular classification of cellular automata based on their dynamical behavior. In this paper we prove that most of its classes are undecidable.
Bruno Durand +2 more
doaj +1 more source
The profile of unlabeled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joint distribution of several level sizes (where the level number is scaled by $\sqrt{n}$) weakly converges to the distribution of the local time of a ...
Bernhard Gittenberger
doaj +1 more source