Sciweavers

2996 search results - page 51 / 600
» Numberings and Randomness
Sort
View
NIPS
2001
13 years 11 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
VTC
2007
IEEE
14 years 4 months ago
Time Slot Partitioning and Random Data Hopping for TDD Based Multihop Wireless Networks
Abstract— A multihop ad hoc wireless network with an interference avoidance model is analyzed for a time division duplex (TDD) air-interface. In accordance with the non-interfere...
Hrishikesh Venkataraman, Abdurazak Mudesir, Sinan ...
JCB
2006
91views more  JCB 2006»
13 years 10 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
BMCBI
2006
105views more  BMCBI 2006»
13 years 10 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
EMSOFT
2005
Springer
14 years 3 months ago
Random testing of interrupt-driven software
Interrupt-driven embedded software is hard to thoroughly test since it usually contains a very large number of executable paths. Developers can test more of these paths using rand...
John Regehr