Sciweavers

534 search results - page 6 / 107
» Power from Random Strings
Sort
View
FCT
2007
Springer
14 years 1 months ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
ICASSP
2011
IEEE
12 years 11 months ago
A method to infer emotions from facial Action Units
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...
Sudha Velusamy, Hariprasad Kannan, Balasubramanian...
JCT
2011
66views more  JCT 2011»
13 years 2 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
ICDAR
2003
IEEE
14 years 19 days ago
Using Character Recognition and Segmentation to Tell Computer from Humans
How do you tell a computer from a human? The situation arises often on the Internet, when online polls are conducted, accounts are requested, undesired email is received, and chat...
Patrice Y. Simard, Richard Szeliski, Josh Benaloh,...