Sciweavers

42 search results - page 3 / 9
» Declassification with Explicit Reference Points
Sort
View
IMCSIT
2010
13 years 5 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
CSDA
2007
169views more  CSDA 2007»
13 years 7 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
ITS
2004
Springer
124views Multimedia» more  ITS 2004»
14 years 27 days ago
A Multi-dimensional Taxonomy for Automating Hinting
Abstract. Hints are an important ingredient of natural language tutorial dialogues. Existing models of hints, however, are limited in capturing their various underlying functions, ...
Dimitra Tsovaltzi, Armin Fiedler, Helmut Horacek
ICCV
2005
IEEE
14 years 9 months ago
Prior-Based Segmentation by Projective Registration and Level Sets
Object detection and segmentation can be facilitated by the availability of a reference object. However, accounting for possible transformations between the different object views...
Tammy Riklin-Raviv, Nahum Kiryati, Nir A. Sochen
BPM
2005
Springer
113views Business» more  BPM 2005»
14 years 1 months ago
Conformance Testing: Measuring the Fit and Appropriateness of Event Logs and Process Models
Most information systems log events (e.g., transaction logs, audit trails) to audit and monitor the processes they support. At the same time, many of these processes have been expl...
Anne Rozinat, Wil M. P. van der Aalst