Sciweavers

2796 search results - page 555 / 560
» The coolest path problem
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
13 years 10 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 10 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
ENGL
2008
186views more  ENGL 2008»
13 years 10 months ago
High Performance Monte-Carlo Based Option Pricing on FPGAs
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...
Xiang Tian, Khaled Benkrid, Xiaochen Gu
IANDC
2008
92views more  IANDC 2008»
13 years 9 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc