IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
MathEdit [23] is a browser-based tool implemented in JavaScript that provides a convenient and intuitive graphical user interface for creating and editing mathematical expressions...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Background: Activities of drug molecules can be predicted by QSAR (quantitative structure activity relationship) models, which overcomes the disadvantages of high cost and long cy...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In radiation environments, alpha particles, cosmic rays and solar wind flux can cause a single event upset (SEU), which is one of the major sources of bit-flips in digital electro...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
To analyze the linear correlations of numeric attributes of government data, this paper proposes a method based on the clustering algorithm. A clustering method is adopted to prun...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
The main purpose of active queue management is to provide congestion information so that sources can set their rates. In this paper, we consider an algorithm which can achieve hig...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Gene pathway can be defined as a group of genes that interact with each other to perform some biological processes. Along with the efforts to identify the individual genes that pl...
IMSCCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Ad hoc networks face the problem of improving networks’ capacity and scalability. The scalability problem can be properly solved through physical hierarchy networking. In this p...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...