5128 search results - page 378 / 1026 » Discrete Component Analysis |
175
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
187
click to vote
ACNS
2005
Springer
16 years 1 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
195
click to vote
SCIA
2005
Springer
16 years 1 months ago
2005
Springer
A traditional solution of area-based stereo uses some kind of windowed pixel intensity correlation. This approach suffers from discretization artifacts which corrupt the correlat...
172
Voted
PADS
2004
ACM
16 years 29 days ago
2004
ACM
Parallel discrete event simulation techniques have enabled the realization of large-scale models of communication networks containing millions of end hosts and routers. However, t...
196
Voted
COMPGEOM
2007
ACM
15 years 11 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...