5128 search results - page 311 / 1026 » Discrete Component Analysis |
179
click to vote
DM
2008
15 years 6 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
203
click to vote
ENTCS
2006
15 years 6 months ago
2006
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
173
Voted
ECCC
2007
15 years 6 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
151
click to vote
IJCM
2007
15 years 6 months ago
2007
We study the efficient numerical simulation of laser surface remelting, a process to improve the surface quality of steel components. To this end we use adaptive grids, which are...
158
click to vote
SIAMAM
2000
15 years 6 months ago
2000
We study the stability and oscillation of traveling fronts in a three-component, advection-reaction biodegradation model. The three components are pollutant, nutrient, and bacteria...