10988 search results - page 2128 / 2198 » Algorithmic Folding Complexity |
137
Voted
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
120
click to vote
GRAPHITE
2003
ACM
15 years 7 months ago
2003
ACM
The complexity of most virtual environments prevents them being rendered in real time even on modern graphics hardware. Knowledge of the visual system of the user viewing the envi...
135
Voted
ISLPED
2003
ACM
15 years 7 months ago
2003
ACM
Enabled by the continuous advancement in fabrication technology, present day synchronous microprocessors include more than 100 million transistors and have clock speeds well in ex...
135
Voted
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
101
Voted
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...