Sciweavers

2430 search results - page 174 / 486
» Computing Tutte Polynomials
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
15 years 10 months ago
Extending XCSF beyond linear approximation
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
CONCUR
1999
Springer
15 years 9 months ago
Validating Firewalls in Mobile Ambients
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
Flemming Nielson, Hanne Riis Nielson, René ...
CGF
2010
128views more  CGF 2010»
15 years 4 months ago
Moving Least Squares Coordinates
We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open ...
Josiah Manson, Scott Schaefer
FSTTCS
2010
Springer
15 years 2 months ago
Determining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...