Sciweavers

1686 search results - page 322 / 338
» Programs as polygraphs: computability and complexity
Sort
View
IJHPCA
2008
131views more  IJHPCA 2008»
15 years 5 months ago
De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...
RECOMB
2005
Springer
16 years 6 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
KSEM
2009
Springer
16 years 12 days ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
TRIDENTCOM
2008
IEEE
16 years 7 days ago
Virtual integrated TCP testbed (VITT)
Research on TCP performance relies either on simulation programs, which run on a single machine, or on the use of real testbeds, where different machines represent different netwo...
Carlo Caini, Rosario Firrincieli, Renzo Davoli, Da...
INFOCOM
2006
IEEE
15 years 12 months ago
Mobile Emulab: A Robotic Wireless and Sensor Network Testbed
Abstract— Simulation has been the dominant research methodology in wireless and sensor networking. When mobility is added, real-world experimentation is especially rare. However,...
David Johnson, Tim Stack, Russ Fish, Daniel Montra...