4865 search results - page 724 / 973 » The Complexity of Graph Connectivity |
104
click to vote
ENTCS
2002
15 years 4 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
126
Voted
TVCG
2008
15 years 4 months ago
2008
We present a novel postprocessing utility called adaptive geometry image (AGIM) for global parameterization techniques that can embed a 3D surface onto a rectangular1 domain. This ...
130
Voted
IJCM
2010
15 years 3 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
142
click to vote
PROCEDIA
2010
15 years 2 months ago
2010
Enterprise Grid enables sharing and aggregation of a set of computing or storage resources connected by enterprise network, but the availability of the resources in this environme...
157
Voted
TPDS
2010
15 years 2 months ago
2010
—This paper presents the development and implementation of a multiprocessor system-on-chip solution for fast and real time simulations of complex and nonlinear wheel-rail contact...