7228 search results - page 1025 / 1446 » From Algorithmic to Subjective Randomness |
186
Voted
MM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
124
click to vote
ASIAN
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
131
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
139
Voted
VISUALIZATION
1997
IEEE
15 years 8 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
112
click to vote
FPGA
2006
ACM
15 years 8 months ago
2006
ACM
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...