Sciweavers

3629 search results - page 4 / 726
» A More Efficient Use of Delta-CRLs
Sort
View
CADE
2001
Springer
14 years 7 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 6 days ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
13 years 10 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
ICC
2007
IEEE
115views Communications» more  ICC 2007»
13 years 10 months ago
Efficient Estimation of More Detailed Internet IP Maps
Router-level maps of the Internet implicate a large body of research on network management, overlay networks, performance evaluation, and security. The inaccuracies in these maps r...
Sangmin Kim, Khaled Harfoush
RECOMB
1997
Springer
13 years 10 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield