Sciweavers

1431 search results - page 83 / 287
» The complexity of random ordered structures
Sort
View
119
Voted
ECAI
2010
Springer
15 years 1 months ago
Open-ended Grounded Semantics
Artificial agents trying to achieve communicative goals in situated interactions in the real-world need powerful computational systems for conceptualizing their environment. In ord...
Michael Spranger, Martin Loetzsch, Simon Pauw
MA
2010
Springer
140views Communications» more  MA 2010»
14 years 11 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
109
Voted
SCN
2008
Springer
136views Communications» more  SCN 2008»
15 years 16 days ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
112
Voted
CORR
2007
Springer
160views Education» more  CORR 2007»
15 years 17 days ago
How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study
The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating...
Suzanne Kieffer, Noelle Carbonell
120
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...