Sciweavers

941 search results - page 18 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2006
199views more  BMCBI 2006»
14 years 9 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 9 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
TKDE
2002
239views more  TKDE 2002»
14 years 9 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
ETS
2009
IEEE
98views Hardware» more  ETS 2009»
14 years 7 months ago
Increasing Robustness of SAT-based Delay Test Generation Using Efficient Dynamic Learning Techniques
Due to the increased speed in modern designs, testing for delay faults has become an important issue in the postproduction test of manufactured chips. A high fault coverage is nee...
Stephan Eggersglüß, Rolf Drechsler
51
Voted
DM
2006
63views more  DM 2006»
14 years 9 months ago
Efficient crossover designs for comparing test treatments with a control treatment
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
A. Sadam Hedayat, Min Yang