Sciweavers

2635 search results - page 40 / 527
» Algorithms for the Database Layout Problem
Sort
View
ER
2004
Springer
83views Database» more  ER 2004»
15 years 7 months ago
Automatic Location and Separation of Records: A Case Study in the Genealogical Domain
Abstract. Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records...
Troy Walker, David W. Embley
FOCS
1997
IEEE
15 years 6 months ago
Storage Management for Evolving Databases
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghav...
DAC
2000
ACM
15 years 6 months ago
Model-based dummy feature placement for oxide chemical-mechanical polishing manufacturability
—Chemical–mechanical polishing (CMP) is an enabling technique used in deep-submicrometer VLSI manufacturing to achieve long range oxide planarization. Post-CMP oxide topography...
Ruiqi Tian, D. F. Wong, Robert Boone
109
Voted
DAC
2004
ACM
15 years 8 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
GD
2005
Springer
15 years 8 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey