Sciweavers

3006 search results - page 501 / 602
» Dimensionality reduction and generalization
Sort
View
EJC
2008
15 years 6 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
Kai-Uwe Schmidt
FUIN
2006
85views more  FUIN 2006»
15 years 6 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
GIS
2006
ACM
15 years 6 months ago
B-Spline curve smoothing under position constraints for line generalisation
Currently, most of the operations performed for the construction of marine charts are still done manually. However, with the development of more and more powerful techniques, new ...
Eric Guilbert, Hui Lin 0002
CCR
2007
76views more  CCR 2007»
15 years 6 months ago
Reducing the TCP acknowledgment frequency
Delayed acknowledgments were introduced to conserve network and host resources. Further reduction of the acknowledgment frequency can be motivated in the same way. However, reduci...
Sara Landström, Lars-Åke Larzon