Sciweavers

1369 search results - page 49 / 274
» Lattice computations for random numbers
Sort
View
FCS
2009
13 years 6 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
LATIN
2010
Springer
14 years 3 months ago
Modelling the LLL Algorithm by Sandpiles
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
Manfred Madritsch, Brigitte Vallée
BMCBI
2006
105views more  BMCBI 2006»
13 years 9 months ago
CRNPRED: highly accurate prediction of one-dimensional protein structures by large-scale critical random networks
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
Akira R. Kinjo, Ken Nishikawa
PAMI
2010
249views more  PAMI 2010»
13 years 7 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
ICDT
2007
ACM
87views Database» more  ICDT 2007»
14 years 3 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi