Sciweavers

974 search results - page 17 / 195
» pairing 2010
Sort
View
GC
2010
Springer
13 years 5 months ago
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
Michael Ferrara, Michael S. Jacobson, Angela Harri...
VLSI
2010
Springer
13 years 2 months ago
Local Biasing and the Use of Nullator-Norator Pairs in Analog Circuits Designs
Although local biasing of components used in an analog circuit is shown to be a very attractive design methodology, significantly simplifying the design procedure [3], it makes the...
Reza Hashemian
COLING
2010
13 years 2 months ago
Robust Measurement and Comparison of Context Similarity for Finding Translation Pairs
In cross-language information retrieval it is often important to align words that are similar in meaning in two corpora written in different languages. Previous research shows tha...
Daniel Andrade, Tetsuya Nasukawa, Jun-ichi Tsujii
XPU
2010
Springer
13 years 6 months ago
Towards Understanding Communication Structure in Pair Programming
Pair Programming has often been reported to be beneficial in software projects. To better understand where these benefits come from we evaluate the aspect of intra-pair communica...
Kai Stapel, Eric Knauss, Kurt Schneider, Matthias ...
ITIIS
2010
183views more  ITIIS 2010»
13 years 6 months ago
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
Hee Joon Hwang, Hyoung Joong Kim, Vasiliy Sachnev,...