Sciweavers

723 search results - page 134 / 145
» On the hyperbolicity constant in graphs
Sort
View
PLDI
1990
ACM
13 years 11 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
COCOON
2008
Springer
13 years 9 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
HPDC
2010
IEEE
13 years 8 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
BMCBI
2008
102views more  BMCBI 2008»
13 years 7 months ago
Monitoring the evolutionary aspect of the Gene Ontology to enhance predictability and usability
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...
Jong C. Park, Tak-eun Kim, Jinah Park
IJRR
2008
92views more  IJRR 2008»
13 years 7 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...