Sciweavers

1169 search results - page 141 / 234
» Degrees of monotone complexity
Sort
View
92
Voted
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 1 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
108
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
90
Voted
IEEEPACT
2006
IEEE
15 years 6 months ago
Complexity-based program phase analysis and classification
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
Chang-Burm Cho, Tao Li
CIA
2001
Springer
15 years 5 months ago
Improving Communication in 3D Virtual Environments by Means of Task Delegation in Agents
User-to-User Communication within Internet-based 3D Virtual Environments is usually difficult mainly due to the trade-off between the capability and the complexity of the interface...
Ricardo Imbert, Angélica de Antonio, Javier...
151
Voted
LPAR
1999
Springer
15 years 5 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies