Sciweavers

5100 search results - page 579 / 1020
» The Linear Complexity of a Graph
Sort
View
192
Voted
AMAI
2004
Springer
16 years 6 days ago
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
PSD
2004
Springer
77views Database» more  PSD 2004»
16 years 5 days ago
Fast Generation of Accurate Synthetic Microdata
Generation of a synthetic microdata set that reproduces the statistical properties of an original microdata set is a promising approach to statistical disclosure control (SDC) of m...
Josep Maria Mateo-Sanz, Antoni Martínez-Bal...
COCOON
2003
Springer
16 years 1 days ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
HAPTICS
2002
IEEE
15 years 11 months ago
Simulated Interactive Needle Insertion
A novel interactive virtual needle insertion simulation is presented. Simulation models are based upon planar tissue deformations and forces measured during needle insertion exper...
Simon P. DiMaio, S. E. Salcudean
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
15 years 11 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...