| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 38
reviews
|
|
|
 |
|
|
|
|
Indexing methods for approximate dictionary searching: comparative analysis
Boytsov L. Journal of Experimental Algorithmics 161.1-1.91, 2011. Type: Article
Anyone who has ever searched for a word (pattern) in a file or checked documents for spelling errors appreciates efficient algorithms that can quickly find relevant occurrences of the pattern, even if it is inexact or incomplete. This ...
|
Aug 18 2011 |
|
|
|
|
|
|
A general buffer scheme for the windows scheduling problem
Bar-Noy A., Ladner R., Christensen J., Tamir T. Journal of Experimental Algorithmics 131.6-1.17, 2009. Type: Article
A goal of window scheduling is to build a schedule--efficient under a number of different measures--to broadcast a set of pages of n different types, via a limited number of channels. The schedule is constraine...
|
May 11 2009 |
|
|
|
|
|
|
M/M/1 queueing systems with inventory
Schwarz M., Sauer C., Daduna H., Kulik R., Szekli R. Queueing Systems: Theory and Applications 54(1): 55-78, 2006. Type: Article
Running out of inventory creates lost sales on one side, and a potential for losing customers on the other. The former is studied in inventory theory, and the latter in queueing theory. This paper combines both inventory management and...
|
Mar 27 2007 |
|
|
|
|
|
|
Clustering with qualitative information
Charikar M., Guruswami V., Wirth A. Journal of Computer and System Sciences 71(3): 360-383, 2005. Type: Article
Grouping or clustering elements based on their relative similarities is a principal step in data analysis, with bioinformatics being one of the applications. Similarity can be defined by a number that measures the strength of the relat...
|
May 23 2006 |
|
|
|
|
|
|
 Biological sequence alignment on the computational grid using the GrADS framework
YarKhan A., Dongarra J. Future Generation Computer Systems 21(6): 980-986, 2005. Type: Article
Grid Application Development Software (GrADS) is a multi-institutional research project created to assist with distributed computing. It provides tools for development and deployment of applications in a grid environment. The paper des...
|
Nov 18 2005 |
|
|
|
|
|
|
Exploration of textual document archives using a fuzzy hierarchical clustering algorithm in the GAMBAL system
Torra V., Miyamoto S., Lanau S. Information Processing and Management: an International Journal 41(3): 587-598, 2005. Type: Article
How to find papers that are most relevant to searches in massive archives of textual information is a question that is both theoretically interesting and practically important. GAMBAL, developed by the authors, is a system that facilit...
|
Jul 19 2005 |
|
|
|
|
|
|
Dynamic programming solution for multiple query optimization problem
Toroslu I., Cosar A. Information Processing Letters 92(3): 149-155, 2004. Type: Article
Executing tasks that are common to a number of queries only once is a common sense idea for improving the performance of batch queries. In the multiple query optimization (MQO) problem, each of a number of queries can be answered by se...
|
Apr 15 2005 |
|
|
|
|
|
|
The lifecycle of a digital historical document: structure and content
Antonacopoulos A., Karatzas D., Krawczyk H., Wiszniewski B. Document engineering (Proceedings of the 2004 ACM Symposium on Document Engineering, Milwaukee, Wisconsin, USA, Oct 28-30, 2004) 147-154, 2004. Type: Proceedings
There are many reasons to preserve historical documents, and the digital age provides new ways to archive them. Not only does the document, in its digitized form, provide convenient access to its content, but it also allows the archivi...
|
Feb 1 2005 |
|
|
|
|
|
|
Strong lower bounds for the prize collecting Steiner problem in graphs
Lucena A., Resende M. Discrete Applied Mathematics 141(1-3): 277-294, 2004. Type: Article
In this complete study, the authors provide an integer programming formulation, a linear programming relaxation, and experimental results for the prize-collecting Steiner problem in graphs. This problem arises in applications, for exam...
|
Dec 21 2004 |
|
|
|
|
|
|
Deformable spanners and applications
Gao J., Guibas L., Nguyen A. Computational geometry (Proceedings of the 20th Annual Symposium on Computational Geometry, Brooklyn, New York, USA, Jun 8-11, 2004) 190-199, 2004. Type: Proceedings
An s-spanner graph in Euclidean space provides a sparse network of paths between pairs of points; the paths are at most s times longer than the distance between their endpoints....
|
Sep 13 2004 |
|
|
|
|
|
| |
|
|
| |
|
|
