Sciweavers

2735 search results - page 130 / 547
» Comparing notions of randomness
Sort
View
IPL
2006
110views more  IPL 2006»
15 years 3 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
DKE
2008
88views more  DKE 2008»
15 years 3 months ago
Quantifying process equivalence based on observed behavior
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...
Ana Karla Alves de Medeiros, Wil M. P. van der Aal...
DCC
2004
IEEE
16 years 2 months ago
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Qian Zhao, Hanying Feng, Michelle Effros
145
Voted
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
15 years 9 months ago
Modeling and recognition of actions through motor primitives
— We investigate modeling and recognition of object manipulation actions for the purpose of imitation based learning in robotics. To model the process, we are using a combination...
David Martínez Mercado, Danica Kragic
114
Voted
EDM
2008
121views Data Mining» more  EDM 2008»
15 years 4 months ago
Analytic Comparison of Three Methods to Evaluate Tutorial Behaviors
We compare the purposes, inputs, representations, and assumptions of three methods to evaluate the fine-grained interactions of intelligent tutors with their students. One method i...
Jack Mostow, Xiaonan Zhang