Sciweavers

115 search results - page 22 / 23
» The Complexity of List Ranking of Trees
Sort
View
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 10 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
RECOMB
2010
Springer
14 years 5 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
BMCBI
2007
217views more  BMCBI 2007»
13 years 11 months ago
OntologyWidget - a reusable, embeddable widget for easily locating ontology terms
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
Catherine Beauheim, Farrell Wymore, Michael Nitzbe...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 5 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ISPD
2005
ACM
130views Hardware» more  ISPD 2005»
14 years 4 months ago
Improved algorithms for link-based non-tree clock networks for skew variability reduction
In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets...
Anand Rajaram, David Z. Pan, Jiang Hu