Sciweavers

5889 search results - page 1171 / 1178
» Graph Layout Problems
Sort
View
BMCBI
2005
147views more  BMCBI 2005»
14 years 9 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
BMCBI
2005
151views more  BMCBI 2005»
14 years 9 months ago
ProMiner: rule-based protein and gene entity recognition
Background: Identification of gene and protein names in biomedical text is a challenging task as the corresponding nomenclature has evolved over time. This has led to multiple syn...
Daniel Hanisch, Katrin Fundel, Heinz-Theodor Mevis...
TMC
2008
127views more  TMC 2008»
14 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
TSP
2008
101views more  TSP 2008»
14 years 9 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
JACM
2000
131views more  JACM 2000»
14 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
« Prev « First page 1171 / 1178 Last » Next »