3575 search results - page 157 / 715 » Presentations of computably enumerable reals |
156
click to vote
ECCC
2006
15 years 6 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
143
click to vote
JAIR
2008
15 years 6 months ago
2008
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
156
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
259
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
170
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...