Sciweavers

6045 search results - page 141 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
JIPS
2007
131views more  JIPS 2007»
13 years 8 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
14 years 8 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
ICRA
2005
IEEE
112views Robotics» more  ICRA 2005»
14 years 1 months ago
Manipulation Planning for Knotting/Unknotting and Tightly Tying of Deformable Linear Objects
— A planning method for knotting/unknotting and tightening manipulation of deformable linear objects is proposed. It is important for linear object manipulation in industrial/med...
Hidefumi Wakamatsu, Akira Tsumaya, Eiji Arai, Shin...
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 6 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
INFORMS
2010
147views more  INFORMS 2010»
13 years 5 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng