3946 search results - page 778 / 790 » The computational complexity of choice sets |
108
click to vote
VMV
2004
15 years 1 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
107
Voted
IFIP3
1998
15 years 1 months ago
1998
Development of a wide spread project intended to teaching Computer Science, integrating a considerable number of students all over a country with big geographical extension and sc...
169
click to vote
GRAPHICSINTERFACE
1996
15 years 29 days ago
1996
We present a comprehensive methodology for realistically animating liquid phenomena. Our approach unifies existing computer graphics techniques for simulating fluids and extends t...
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
101
Voted
CCS
2010
ACM
14 years 12 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...