2434 search results - page 65 / 487 » Algorithmic Randomness of Closed Sets |
129
click to vote
SPAA
1997
ACM
15 years 7 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
131
click to vote
GLVLSI
2007
IEEE
15 years 9 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
138
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
147
click to vote
3DIM
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
139
Voted
IVC
2007
15 years 3 months ago
2007
This paper presents an optimisation technique to automatically select a set of control parameters for a Markov Random Field. The method is based on the Reactive Tabu Search strate...