Sciweavers

1484 search results - page 84 / 297
» Ants meeting algorithms
Sort
View
SACMAT
2009
ACM
16 years 1 months ago
Access control policy combining: theory meets practice
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
Ninghui Li, Qihua Wang, Wahbeh H. Qardaji, Elisa B...
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
16 years 6 days ago
A Method to Solve Cyclotomic Norm Equations
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Nick Howgrave-Graham, Michael Szydlo
EUSAI
2003
Springer
16 years 14 hour ago
Towards Computer Understanding of Human Interactions
People meet in order to interact - disseminating information, making decisions, and creating new ideas. Automatic analysis of meetings is therefore important from two points of vie...
Iain McCowan, Daniel Gatica-Perez, Samy Bengio, Da...
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
15 years 10 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight
ANTS
2006
Springer
127views Algorithms» more  ANTS 2006»
15 years 10 months ago
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
Kjell Wooding, Hugh C. Williams