6409 search results - page 607 / 1282 » A Computational Algorithm for Origami Design |
219
click to vote
ANCS
2005
ACM
16 years 23 days ago
2005
ACM
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
192
click to vote
IPPS
2002
IEEE
16 years 4 days ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
167
click to vote
DAC
1999
ACM
16 years 8 months ago
1999
ACM
Recently, several algorithms for interconnect optimization via repeater insertion and wire sizing have appeared based on the Elmore delay model. Using the Devgan noise metric [6] ...
206
click to vote
DAC
2002
ACM
16 years 8 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
198
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...