Sciweavers

7988 search results - page 1238 / 1598
» A Useful Undecidable Theory
Sort
View
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
16 years 5 days ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
CVPR
2010
IEEE
16 years 5 days ago
Minimum length in the tangent bundle as a model for curve completion
The phenomenon of visual curve completion, where the visual system completes the missing part (e.g., due to occlusion) between two contour fragments, is a major problem in percept...
Guy Ben-Yosef, Ohad Ben Shahar
AGP
2003
IEEE
16 years 4 days ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir
140
Voted
ARITH
2003
IEEE
16 years 4 days ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
ENC
2003
IEEE
16 years 3 days ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
« Prev « First page 1238 / 1598 Last » Next »