DM
2007
13 years 4 months ago
2007
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
IPL
2008
13 years 4 months ago
2008
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
IPL
2008
13 years 4 months ago
2008
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
ENTCS
2006
13 years 4 months ago
2006
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
ALGORITHMICA
2006
13 years 4 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
AUTOMATICA
2010
13 years 4 months ago
2010
In this paper, an original result in terms of a sufficient condition to test identifiability of nonlinear delayed-differential models with constant delays and multi-inputs is give...
STOC
1994
ACM
13 years 8 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
ICYCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In 21 century, an era of information and internet, it is essential for universities to develop their education in order to be focused. Testing online has unparalleled advantages i...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Retrieving videos using key words requires obtaining the semantic features of the videos. Most work reported in the literature focuses on annotating a video shot with a fixed numb...
STOC
2002
ACM
14 years 4 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...