Sciweavers

4488 search results - page 162 / 898
» Properties of NP-Complete Sets
Sort
View
COCOON
2003
Springer
14 years 1 months ago
On Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
Günter Rote, Cao An Wang, Lusheng Wang, Yin-F...
ACSD
2001
IEEE
121views Hardware» more  ACSD 2001»
13 years 12 months ago
A structural encoding technique for the synthesis of asynchronous circuits
This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is based on a structural encoding of the system in such ...
Josep Carmona, Jordi Cortadella, Enric Pastor
INFOVIS
1995
IEEE
13 years 11 months ago
SDM: malleable information graphics
SelectiveDynamic Manipulation (SDM) is a paradigm for interacting with objects in visualizations, Its methodsoffer a high degree of selectivity, in choosing object sets, in the se...
Mei C. Chuah, Steven F. Roth, Joe Mattis, John Kol...
TAPSOFT
1989
Springer
13 years 11 months ago
Independence of Negative Constraints
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set asso...
Jean-Louis Lassez, Ken McAloon
CEAS
2008
Springer
13 years 10 months ago
Empirical research on IP blacklisting
This paper describes two innovative analysis methods for IPv4 address sets such as antispam blacklists. First, the contents analysis provides means of measuring key properties of ...
Christian Dietrich, Christian Rossow