DMTCS
2010
13 years 8 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
TCS
2010
13 years 9 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
ORL
2007
13 years 11 months ago
2007
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
TIT
2002
13 years 11 months ago
2002
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
OL
2008
13 years 11 months ago
2008
In this paper, we point out some inconsistencies in the earlier work of Ahmad and Husain (Appl. Math. Lett. 18, 721
KES
2008
Springer
13 years 11 months ago
2008
Springer
Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to e...
COR
2006
13 years 11 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
IPCO
1990
14 years 18 days ago
1990
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
CIKM
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we describe modifications to a natural language grocery retrieval system, introduced in our earlier work. We also compare our system against an off-the-shelf retriev...
INFOCOM
1997
IEEE
14 years 3 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...