Sciweavers

2255 search results - page 251 / 451
» Computing a Center-Transversal Line
Sort
View
CW
2003
IEEE
15 years 4 months ago
Utilizing Statistical Characteristics of N-grams for Intrusion Detection
Information and infrastructure security is a serious issue of global concern. As the last line of defense for security infrastructure, intrusion detection techniques are paid more...
Zhuowei Li, Amitabha Das, Sukumar Nandi
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 4 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
ISQED
2003
IEEE
109views Hardware» more  ISQED 2003»
15 years 4 months ago
Modeling and Analysis of Power Distribution Networks for Gigabit Applications
—As the operating frequency of digital systems increases and voltage swing decreases, it becomes very important to characterize and analyze power distribution networks (PDNs) acc...
Wendemagegnehu T. Beyene, Chuck Yuan, Joong-Ho Kim...
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
15 years 4 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
FOCS
2002
IEEE
15 years 4 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich