Sciweavers

5275 search results - page 675 / 1055
» Computing by observing
Sort
View
CONCUR
2006
Springer
15 years 8 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
CVPR
2005
IEEE
15 years 8 months ago
Fast Illumination-Invariant Background Subtraction Using Two Views: Error Analysis, Sensor Placement and Applications
Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the u...
Ser-Nam Lim, Anurag Mittal, Larry S. Davis, Nikos ...
IWCMC
2010
ACM
15 years 8 months ago
A flow trace generator using graph-based traffic classification techniques
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique...
Peter Siska, Marc Ph. Stoecklin, Andreas Kind, Tor...
PAM
2010
Springer
15 years 8 months ago
Influence of the Packet Size on the One-Way Delay in 3G Networks
We currently observe a rising interest in mobile broadband, which users expect to perform in a similar way as its fixed counterpart. On the other hand, the capacity allocation proc...
Patrik Arlos, Markus Fiedler
COLT
2008
Springer
15 years 8 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy