Sciweavers

14704 search results - page 342 / 2941
» computing 2007
Sort
View
IJFCS
2007
93views more  IJFCS 2007»
15 years 4 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
JAL
2007
95views more  JAL 2007»
15 years 4 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
127
Voted
IJON
2007
55views more  IJON 2007»
15 years 4 months ago
Short-term plasticity in a computational model of the tail-withdrawal circuit in Aplysia
The tail-withdrawal circuit of Aplysia provides a useful model system for investigating synaptic dynamics. Sensory neurons within the circuit manifest several forms of synaptic pl...
Douglas A. Baxter, John H. Byrne
134
Voted
NA
2007
62views more  NA 2007»
15 years 4 months ago
Runge-Kutta interpolants for high precision computations
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
Ch. Tsitouras
114
Voted
NECO
2007
68views more  NECO 2007»
15 years 4 months ago
Single Neuron Computation: From Dynamical System to Feature Detector
ll Text][Abstract] , October 18, 2006; 26 (42): 10826-10846.J. Neurosci. B. R. Conway and M. S. Livingstone Spatial and temporal properties of cone signals in alert macaque primary...
Sungho Hong, Blaise Agüera y Arcas, Adrienne ...