Sciweavers

8810 search results - page 376 / 1762
» Open. Closed. Open
Sort
View
SPIRE
2009
Springer
16 years 3 days ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
KI
2001
Springer
16 years 19 hour ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
Stefan Edelkamp, Ulrich Meyer
205
Voted
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
16 years 7 hour ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
185
Voted
ANSS
2000
IEEE
16 years 6 hour ago
An Analytic Method for Predicting Simulation Parallelism
The abilityto predict the performance of a simulationapplicationbefore its implementationis an important factor to the adoption of parallel simulation technology in industry. Idea...
Hong Wang, Yong Meng Teo, Seng Chuan Tay
ASIACRYPT
2000
Springer
15 years 12 months ago
Zero-Knowledge and Code Obfuscation
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
Satoshi Hada