Sciweavers

1019 search results - page 41 / 204
» Uniform Functors on Sets
Sort
View
ICAPR
2005
Springer
14 years 1 months ago
Optical Flow-Based Segmentation of Containers for Automatic Code Recognition
This paper presents a method for accurately segmenting moving container trucks in image sequences. This task allows to increase the performance of a recognition system that must id...
Vicente Atienza, Ángel Rodas, Gabriela Andr...
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
14 years 1 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
COLING
1996
13 years 9 months ago
Segmentation Standard for Chinese Natural Language Processing
This paper proposes a segmentation standard for Chinese natural language processing. The standard is proposed to achieve linguistic felicity, computational feasibility, and data u...
Chu-Ren Huang, Keh-Jiann Chen, Li-Li Chang
ETT
2000
106views Education» more  ETT 2000»
13 years 7 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
CSFW
2006
IEEE
14 years 1 months ago
On the Completeness of Attack Mutation Algorithms
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
Shai Rubin, Somesh Jha, Barton P. Miller