Sciweavers

361 search results - page 61 / 73
» Finding Optimal Pairs of Patterns
Sort
View
ANCS
2006
ACM
13 years 11 months ago
Efficient memory utilization on network processors for deep packet inspection
Deep Packet Inspection (DPI) refers to examining both packet header and payload to look for predefined patterns, which is essential for network security, intrusion detection and c...
Piti Piyachon, Yan Luo
LREC
2010
236views Education» more  LREC 2010»
13 years 8 months ago
ProPOSEC: A Prosody and PoS Annotated Spoken English Corpus
We have previously reported on ProPOSEL, a purpose-built Prosody and PoS English Lexicon compatible with the Python Natural Language ToolKit. ProPOSEC is a new corpus research res...
Claire Brierley, Eric Atwell
PR
2008
228views more  PR 2008»
13 years 7 months ago
Accurate integration of multi-view range images using k-means clustering
3D modelling finds a wide range of applications in industry. However, due to the presence of surface scanning noise, accumulative registration errors, and improper data fusion, re...
Hong Zhou, Yonghuai Liu
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
13 years 11 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
DAM
2008
129views more  DAM 2008»
13 years 7 months ago
Minimum cost homomorphisms to semicomplete multipartite digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
Gregory Gutin, Arash Rafiey, Anders Yeo