Sciweavers

2638 search results - page 451 / 528
» Random Geometric Complexes
Sort
View
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
14 years 1 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
ISPD
2004
ACM
161views Hardware» more  ISPD 2004»
14 years 1 months ago
Early-stage power grid analysis for uncertain working modes
High performance integrated circuits are now reaching the 100-plus watt regime, and power delivery and power grid signal integrity have become critical. Analyzing the performance ...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 1 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
COLT
2004
Springer
14 years 1 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
ECCV
2004
Springer
14 years 1 months ago
Robust Encoding of Local Ordinal Measures: A General Framework of Iris Recognition
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
Zhenan Sun, Tieniu Tan, Yunhong Wang