Sciweavers

2887 search results - page 44 / 578
» Name Generation and Linearity
Sort
View
ICRA
2006
IEEE
91views Robotics» more  ICRA 2006»
15 years 11 months ago
Manipulation Planning for Unraveling Linear Objects
— A planning method for unraveling manipulation of deformable linear objects is proposed. In manipulation of a linear object, its raveling must be avoided. It takes much time to ...
Hidefumi Wakamatsu, Akira Tsumaya, Eiji Arai, Shin...
BMCBI
2010
243views more  BMCBI 2010»
15 years 5 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
ICCAD
2006
IEEE
100views Hardware» more  ICCAD 2006»
16 years 2 months ago
Faster, parametric trajectory-based macromodels via localized linear reductions
— Trajectory-based methods offer an attractive methodology for automated, on-demand generation of macromodels for custom circuits. These models are generated by sampling the stat...
Saurabh K. Tiwary, Rob A. Rutenbar
TIT
2011
131views more  TIT 2011»
15 years 22 days ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
WCC
2005
Springer
122views Cryptology» more  WCC 2005»
15 years 11 months ago
Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
Yun-Pyo Hong, Hong-Yeop Song