Sciweavers

8141 search results - page 1628 / 1629
» Higher Order Generalization
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 11 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CORR
2008
Springer
174views Education» more  CORR 2008»
13 years 6 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
BMCBI
2006
123views more  BMCBI 2006»
13 years 6 months ago
How to decide? Different methods of calculating gene expression from short oligonucleotide array data will give different result
Background: Short oligonucleotide arrays for transcript profiling have been available for several years. Generally, raw data from these arrays are analysed with the aid of the Mic...
Frank F. Millenaar, John Okyere, Sean T. May, Mart...
NAR
1998
70views more  NAR 1998»
13 years 5 months ago
Haemophilia B: database of point mutations and short additions and deletions--eighth edition
The eighth edition of the haemophilia B database (http://www.umds.ac.uk/molgen/haemBdatabase.htm ) lists in an easily accessible form all known factor IX mutations due to small ch...
F. Giannelli, P. M. Green, S. S. Sommer, M.-C. Poo...
« Prev « First page 1628 / 1629 Last » Next »