Sciweavers

225 search results - page 24 / 45
» Retargetable binary utilities
Sort
View
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
GLVLSI
2007
IEEE
186views VLSI» more  GLVLSI 2007»
13 years 7 months ago
Block placement to ensure channel routability
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
Shigetoshi Nakatake, Zohreh Karimi, Taraneh Taghav...
JGTOOLS
2007
144views more  JGTOOLS 2007»
13 years 7 months ago
Faster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
Eric Risser, Musawir Shah, Sumanta N. Pattanaik
TIP
1998
137views more  TIP 1998»
13 years 7 months ago
Adaptive, quadratic preprocessing of document images for binarization
Abstract—This paper presents an adaptive algorithm for preprocessing document images prior to binarization in character recognition problems. Our method is similar in its approac...
Shan Mo, V. John Mathews
GLOBECOM
2010
IEEE
13 years 5 months ago
Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
Fen Hou, Jianwei Huang