Sciweavers

575 search results - page 55 / 115
» A Note on Karr's Algorithm
Sort
View
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
15 years 29 days ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling
CORR
2010
Springer
92views Education» more  CORR 2010»
14 years 11 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin

Book
246views
16 years 9 months ago
Using, Understanding, and Unraveling The OCaml Language
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
Didier Remy

Lecture Notes
773views
16 years 9 months ago
Computer Networking and Internet Protocols: A Comprehensive Introduction
The lecture notes cover the following topics, Fundamentals (OSI Reference Model, Coding, Ethernet), Data Link Control (Flow Control, Error Control, HDLC, PPP), Internet Protocol ...
Raj Jain
ICIP
2009
IEEE
16 years 7 days ago
Joint Recovery And Segmentation Of Polarimetric Images Using A Compound Mrf And Mixture Modeling
We propose a new approach for the restoration of polarimetric Stokes images, capable of simultaneously segmenting and restoring the images. In order to easily handle the admissibi...