6409 search results - page 782 / 1282 » A Computational Algorithm for Origami Design |
135
click to vote
VLSID
2009
IEEE
16 years 5 months ago
2009
IEEE
Synthesis of reversible logic has become a very important research area. In recent years several algorithms ? heuristic as well as exact ones ? have been introduced in this area. ...
155
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
131
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
143
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
144
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...