Sciweavers

16626 search results - page 3034 / 3326
» Computing is a natural science
Sort
View
CN
2008
98views more  CN 2008»
15 years 6 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
GC
2008
Springer
15 years 6 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
BMCBI
2006
100views more  BMCBI 2006»
15 years 6 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
CG
2006
Springer
15 years 6 months ago
Realtime automatic selection of good molecular views
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
Pere-Pau Vázquez, Miquel Feixas, Mateu Sber...
IANDC
2006
121views more  IANDC 2006»
15 years 6 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
« Prev « First page 3034 / 3326 Last » Next »