Sciweavers

7886 search results - page 1216 / 1578
» An evaluation of bipartitioning techniques
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ISBRA
2010
Springer
15 years 10 months ago
A Novel Approach for Compressing Phylogenetic Trees
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
QOSA
2010
Springer
15 years 10 months ago
Parameterized Reliability Prediction for Component-Based Software Architectures
Critical properties of software systems, such as reliability, should be considered early in the development, when they can govern crucial architectural design decisions. A number o...
Franz Brosch, Heiko Koziolek, Barbora Buhnova, Ral...
DCOSS
2010
Springer
15 years 10 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 10 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
« Prev « First page 1216 / 1578 Last » Next »