3898 search results - page 631 / 780 » On the Bit Extraction Problem |
180
click to vote
ECCV
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
174
click to vote
CSMR
1999
IEEE
15 years 10 months ago
1999
IEEE
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
183
click to vote
PPOPP
1999
ACM
15 years 10 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
173
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
186
click to vote
CHARME
1999
Springer
15 years 10 months ago
1999
Springer
Hardware description languages (HDLs) are used today to describe circuits at all levels. In large HDL programs, there is a need for source code reduction techniques to address a my...