Sciweavers

648 search results - page 128 / 130
» Lowness for Demuth Randomness
Sort
View
BMCBI
2005
127views more  BMCBI 2005»
13 years 9 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao
BMCBI
2005
246views more  BMCBI 2005»
13 years 9 months ago
ParPEST: a pipeline for EST data analysis based on parallel computing
Background: Expressed Sequence Tags (ESTs) are short and error-prone DNA sequences generated from the 5' and 3' ends of randomly selected cDNA clones. They provide an im...
Nunzio D'Agostino, Mario Aversano, Maria Luisa Chi...
TOG
2008
253views more  TOG 2008»
13 years 9 months ago
4-points congruent sets for robust pairwise surface registration
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
Dror Aiger, Niloy J. Mitra, Daniel Cohen-Or
TWC
2008
120views more  TWC 2008»
13 years 9 months ago
A cartel maintenance framework to enforce cooperation in wireless networks with selfish users
Abstract-- In distributed wireless networks without centralized control, each user is its own authority to maximize its own performance. This distributed characteristic provides th...
Zhu Han, Zhu Ji, K. J. Ray Liu
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 9 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...