Sciweavers

16666 search results - page 3333 / 3334
» Descriptive and Computational Complexity
Sort
View
ISPA
2005
Springer
14 years 27 days ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
COMPGEOM
2010
ACM
14 years 14 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
14 years 10 days ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
BMCBI
2010
119views more  BMCBI 2010»
13 years 7 months ago
Multi-task learning for cross-platform siRNA efficacy prediction: an in-silico study
Background: Gene silencing using exogenous small interfering RNAs (siRNAs) is now a widespread molecular tool for gene functional study and new-drug target identification. The key...
Qi Liu, Qian Xu, Vincent Wenchen Zheng, Hong Xue, ...
BMCBI
2007
156views more  BMCBI 2007»
13 years 7 months ago
Predictive modeling of plant messenger RNA polyadenylation sites
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
Guoli Ji, Jianti Zheng, Yingjia Shen, Xiaohui Wu, ...
« Prev « First page 3333 / 3334 Last » Next »