Sciweavers

306 search results - page 29 / 62
» Underspecified computation of normal forms
Sort
View
ICC
2007
IEEE
128views Communications» more  ICC 2007»
13 years 7 months ago
The Power of Temporal Pattern Processing in Anomaly Intrusion Detection
Abstract— A clear deficiency in most of todays Anomaly Intrusion Detection Systems (AIDS) is their inability to distinguish between a new form of legitimate normal behavior and ...
Mohammad Al-Subaie, Mohammad Zulkernine
ICCV
2003
IEEE
14 years 9 months ago
Automatic Video Summarization by Graph Modeling
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...
Chong-Wah Ngo, Yu-Fei Ma, HongJiang Zhang
ICIP
2005
IEEE
14 years 9 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
TSMC
1998
74views more  TSMC 1998»
13 years 7 months ago
An invariant performance measure for surface reconstruction using the volume between two surfaces
—In this paper, we propose the volume between two surfaces normalized by the surface area (interpreted as average distance between two surfaces) as an invariant quantitative meas...
June-Ho Yi, David M. Chelberg
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 11 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas