You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 2, Issue 4

December 2009 - 12 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (12)

  • Article
  • Open Access
4 Citations
10,662 Views
23 Pages

1 December 2009

Techniques in image similarity can be used to improve the classification of breast cancer images. Breast cancer images in the mammogram modality have an abundance of non-cancerous structures that are similar to cancer, which make classification of im...

  • Article
  • Open Access
52 Citations
12,179 Views
30 Pages

Predicting Radiological Panel Opinions Using a Panel of Machine Learning Classifiers

  • Dmitriy Zinovev,
  • Daniela Raicu,
  • Jacob Furst and
  • Samuel G. Armato III

30 November 2009

This paper uses an ensemble of classifiers and active learning strategies to predict radiologists’ assessment of the nodules of the Lung Image Database Consortium (LIDC). In particular, the paper presents machine learning classifiers that model agree...

  • Article
  • Open Access
9,844 Views
24 Pages

26 November 2009

Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application ar...

  • Article
  • Open Access
17 Citations
10,661 Views
20 Pages

Linear-Time Text Compression by Longest-First Substitution

  • Ryosuke Nakamura,
  • Shunsuke Inenaga,
  • Hideo Bannai,
  • Takashi Funamoto,
  • Masayuki Takeda and
  • Ayumi Shinohara

25 November 2009

We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm...

  • Article
  • Open Access
17 Citations
12,462 Views
42 Pages

18 November 2009

The emergence of novel sensing elements, computing nodes, wireless communication and integration technology provides unprecedented possibilities for the design and application of intelligent systems. Each new application system must be designed from...

  • Article
  • Open Access
43 Citations
13,332 Views
19 Pages

A Framework for Bioacoustic Vocalization Analysis Using Hidden Markov Models

  • Yao Ren,
  • Michael T. Johnson,
  • Patrick J. Clemins,
  • Michael Darre,
  • Sharon Stuart Glaeser,
  • Tomasz S. Osiejuk and
  • Ebenezer Out-Nyarko

18 November 2009

Using Hidden Markov Models (HMMs) as a recognition framework for automatic classification of animal vocalizations has a number of benefits, including the ability to handle duration variability through nonlinear time alignment, the ability to incorpor...

  • Article
  • Open Access
8 Citations
13,155 Views
18 Pages

CADrx for GBM Brain Tumors: Predicting Treatment Response from Changes in Diffusion-Weighted MRI

  • Jing Huo,
  • Kazunori Okada,
  • Hyun J. Kim,
  • Whitney B. Pope,
  • Jonathan G. Goldin,
  • Jeffrey R. Alger and
  • Matthew S. Brown

16 November 2009

The goal of this study was to develop a computer-aided therapeutic response (CADrx) system for early prediction of drug treatment response for glioblastoma multiforme (GBM) brain tumors with diffusion weighted (DW) MR images. In conventional Macdonal...

  • Article
  • Open Access
34 Citations
8,748 Views
23 Pages

11 November 2009

Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicate...

  • Article
  • Open Access
9,678 Views
24 Pages

Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks

  • Stephan Eidenbenz,
  • Gunes Ercal-Ozkaya,
  • Adam Meyerson,
  • Allon Percus and
  • Sarvesh Varatharajan

14 October 2009

We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwardin...

  • New Book Received
  • Open Access
7,758 Views
2 Pages

12 October 2009

The Encyclopedia of Algorithms provides a comprehensive set of solutions to important algorithmic problems for students and researchers, including high-impact solutions from the most recent decade. [...]

of 2

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893