Sciweavers

1487 search results - page 10 / 298
» The Computational Complexity of Link Building
Sort
View
ICDCSW
2011
IEEE
12 years 7 months ago
Link-Level Network Topology Generation
Abstract—Internet topology generation involves producing synthetic network topologies that imitate the characteristics of the Internet. Although the accuracy of newly developed n...
Mehmet Burak Akgun, Mehmet Hadi Gunes
SIGGRAPH
1994
ACM
13 years 11 months ago
A clustering algorithm for radiosity in complex environments
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
Brian E. Smits, James Arvo, Donald P. Greenberg
BMCBI
2004
153views more  BMCBI 2004»
13 years 7 months ago
Computational protein biomarker prediction: a case study for prostate cancer
Background: Recent technological advances in mass spectrometry pose challenges in computational mathematics and statistics to process the mass spectral data into predictive models...
Michael Wagner, Dayanand N. Naik, Alex Pothen, Sri...
ICNC
2005
Springer
14 years 26 days ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
TC
2008
13 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...