Sciweavers

1160 search results - page 92 / 232
» Dynamic Programming Algorithm for Training Functional Networ...
Sort
View
INFOCOM
2000
IEEE
15 years 6 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
IJCNN
2006
IEEE
15 years 8 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
EMNLP
2008
15 years 3 months ago
A Generative Model for Parsing Natural Language to Meaning Representations
In this paper, we present an algorithm for learning a generative model of natural language sentences together with their formal meaning representations with hierarchical structure...
Wei Lu, Hwee Tou Ng, Wee Sun Lee, Luke S. Zettlemo...
CSB
2005
IEEE
163views Bioinformatics» more  CSB 2005»
15 years 8 months ago
A symbolic approach to the simulation of biochemical models: application to circadian rhythms
Symbolic rewriting systems are gaining interest as tools for simulating biochemical dynamics. Compared to traditional methods based on differential equations, the symbolic approac...
Federico Fontana, Luca Bianco, Vincenzo Manca
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 2 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...