Sciweavers

6568 search results - page 31 / 1314
» Reducing the Complexity of Reductions
Sort
View
MFCS
2004
Springer
15 years 5 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
JSYML
2010
74views more  JSYML 2010»
14 years 10 months ago
Baire reductions and good Borel reducibilities
Abstract. In [8] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving...
Luca Motto Ros
ICCAD
2002
IEEE
175views Hardware» more  ICCAD 2002»
15 years 8 months ago
Efficient model order reduction via multi-node moment matching
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
Yehea I. Ismail
ICCCN
2008
IEEE
15 years 6 months ago
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
Navodaya Garepalli, Kartik Gopalan, Ping Yang
PIMRC
2008
IEEE
15 years 6 months ago
Downlink overhead reduction for Multi-Cell Cooperative Processing enabled wireless networks
—Multi-cell Cooperative Processing (MCP) has been recognised as an efficient technique for increasing spectral efficiency of future cellular systems. However the provided bene...
Agisilaos Papadogiannis, Hans Jørgen Bang, ...