Sciweavers

4860 search results - page 576 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CN
2002
82views more  CN 2002»
15 years 4 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
140
Voted
INFOCOM
2006
IEEE
15 years 11 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
COMGEO
2006
ACM
15 years 5 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
BMCBI
2010
175views more  BMCBI 2010»
15 years 5 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
145
Voted
ECCV
2006
Springer
16 years 6 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee