Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (57)
- TÜBİTAK (33)
- Dartmouth College (31)
- Wright State University (31)
- Purdue University (30)
-
- Brigham Young University (22)
- Air Force Institute of Technology (20)
- City University of New York (CUNY) (20)
- California Polytechnic State University, San Luis Obispo (19)
- Selected Works (19)
- University of Nebraska - Lincoln (17)
- University of Massachusetts Amherst (16)
- Old Dominion University (14)
- Portland State University (12)
- New Jersey Institute of Technology (11)
- Edith Cowan University (9)
- Missouri University of Science and Technology (9)
- Syracuse University (9)
- Nova Southeastern University (8)
- Smith College (8)
- Louisiana State University (7)
- Technological University Dublin (6)
- The University of Maine (6)
- University of Massachusetts - Amherst (6)
- University of Nevada, Las Vegas (6)
- William & Mary (6)
- California State University, San Bernardino (5)
- University of Nebraska at Omaha (5)
- University of New Hampshire (5)
- East Tennessee State University (4)
- Keyword
-
- College of Engineering and Computer Science (8)
- Computer Science (8)
- Engineering (8)
- Newsletters (8)
- Science news (8)
-
- Technical writing (8)
- Mobile computing (7)
- Data mining (6)
- Digital libraries (5)
- [RSTDPub] (5)
- Genetic algorithms (4)
- Geographic information systems (4)
- Information retrieval (4)
- Information visualization (4)
- Multicast (4)
- Security (4)
- Software engineering (4)
- Alpha-bearing wastes; Argonne Model for Universal Solvent Extraction (AMUSE); Computer programming; Separation (Technology); Software engineering; System analysis; Systems engineering; Transuranium elements – Separation; Uranium Recovery by Extraction (UREX) (3)
- Bluetooth (3)
- Computer networks (3)
- Computer simulation (3)
- Electronic data processing -- Distributed processing (3)
- FDTD (3)
- Information storage and retrieval systems (3)
- Metadata (3)
- Middleware (3)
- Neural networks (3)
- Predictable assembly (3)
- Privacy (3)
- Routing (3)
- Publication
-
- Research Collection School Of Computing and Information Systems (57)
- Computer Science Technical Reports (37)
- Turkish Journal of Electrical Engineering and Computer Sciences (33)
- Department of Computer Science Technical Reports (30)
- Theses and Dissertations (25)
-
- Faculty Publications (21)
- Kno.e.sis Publications (17)
- Computer Science Department Faculty Publication Series (16)
- Computer Science and Software Engineering (11)
- Theses (11)
- Electronic Theses and Dissertations (9)
- Philip L Frana (9)
- BITs and PCs Newsletter (8)
- CSE Conference and Workshop Papers (8)
- Collaborative Agent Design (CAD) Research Center (8)
- Computer Science Faculty Publications (8)
- Computer Science Faculty Publications and Presentations (8)
- Computer Science: Faculty Publications (8)
- Electrical Engineering and Computer Science - All Scholarship (8)
- CCE Theses and Dissertations (7)
- CSE Technical Reports (7)
- Dartmouth Scholarship (7)
- R. Manmatha (7)
- Research outputs pre 2011 (7)
- Computer Science and Engineering Faculty Publications (6)
- Dissertations, Theses, and Masters Projects (6)
- Masters Theses (6)
- Separations Campaign (TRP) (6)
- Center for Coastal and Ocean Mapping (5)
- Computer Science Faculty Research & Creative Works (5)
Articles 511 - 516 of 516
Full-Text Articles in Physical Sciences and Mathematics
Features For Word Spotting In Historical Manuscripts, Toni M. Rath, R. Manmatha
Features For Word Spotting In Historical Manuscripts, Toni M. Rath, R. Manmatha
R. Manmatha
For the transition from traditional to digital libraries, the large number of handwritten manuscripts that exist pose a great challenge. Easy access to such collections requires an index, which is currently created manually at great cost. Because automatic handwriting recognizers fail on historical manuscripts, the word spotting technique has been developed: the words in a collection are matched as images and grouped into clusters which contain all instances of the same word. By annotating ``interesting clusters," an index that links words to the locations where they occur can be built automatically.
Due to the noise in historical documents, selecting the …
Word Image Matching Using Dynamic Time Warping, Toni M. Rath, R. Manmatha
Word Image Matching Using Dynamic Time Warping, Toni M. Rath, R. Manmatha
R. Manmatha
Libraries and other institutions are interested in providing access to scanned versions of their large collections of handwritten historical manuscripts on the web or on CDROMs. Providing convenient access to a collection requires an index which is manually created at great labour and expense. Since current handwriting recognizers do not perform well on historical documents, a technique called word spotting has been developed. It addresses the need for indexing single-author handwritten historical manuscripts in a new way: word images are matched to form clusters which contain occurrences of the same word throughout a collection. By annotating ``interesting" clusters, an index …
A Formal Approach To Score Normalization For Metasearch, H. Sever, R. Manmatha
A Formal Approach To Score Normalization For Metasearch, H. Sever, R. Manmatha
R. Manmatha
Meta-search, or the combination of the outputs of different search engines in response to a query, has been shown to improve performance. Since the scores produced by different search engines are not comparable, researchers have often decomposed the metasearch problem into a score normalization step followed by a combination step. Combination has been studied by many researchers. While appropriate normalization can affect performance, most of the normalization schemes suggested are ad hoc in nature.
In this paper, we propose a formal approach to normalizing scores for meta-search by taking the distributions of the scores into account. Recently, it has been …
A Critical Examination Of Tdt’S Cost Function, R. Manmatha, Ao Feng, James Allan
A Critical Examination Of Tdt’S Cost Function, R. Manmatha, Ao Feng, James Allan
R. Manmatha
Topic Detection and Tracking (TDT) tasks are evaluated using a cost function. The standard TDT cost function assumes a constant probability of relevance P(rel) across all topics. In practice, P(rel) varies widely across topics. We argue using both theoretical and experimental evidence that the cost function should be modified to account for the varying P(rel).
Indexing For A Digital Library Of George Washington’S Manuscripts: A Study Of Word Matching Techniques, T. M. Rath, S. Kane, A. Lehman, E. Partridge, R. Manmatha
Indexing For A Digital Library Of George Washington’S Manuscripts: A Study Of Word Matching Techniques, T. M. Rath, S. Kane, A. Lehman, E. Partridge, R. Manmatha
R. Manmatha
In a multimedia world, one would like electronic access to all kinds of information. But a lot of important information still only exists on paper and it is a challenge to efficiently access or navigate this information even if it is scanned in. The previously proposed \word spotting" idea is an approach for accessing and navigating a collection of handwritten documents available as images using an index automatically generated by matching words as pictures. The most difficult task in solving this problem is the matching of word images. The quality of the aged documents and the variations in handwriting make …
Candidate Set Strategies For Ant Colony Optimisation, Marcus Randall, James Montgomery
Candidate Set Strategies For Ant Colony Optimisation, Marcus Randall, James Montgomery
Marcus Randall
Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests these on the travelling salesman and car sequencing problems. The results show that the use of candidate sets helps to find competitive solutions to the test problems in a relatively short amount of time.