Sciweavers

10890 search results - page 1676 / 2178
» Automatic Complexity Analysis
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
CCS
2011
ACM
14 years 6 months ago
Fear the EAR: discovering and mitigating execution after redirect vulnerabilities
The complexity of modern web applications makes it difficult for developers to fully understand the security implications of their code. Attackers exploit the resulting security v...
Adam Doupé, Bryce Boe, Christopher Kruegel,...
WWW
2005
ACM
16 years 7 months ago
CubeSVD: a novel approach to personalized Web search
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This pa...
Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, ...
PERCOM
2006
ACM
16 years 6 months ago
Exploiting information relationships for access control in pervasive computing
Many information services in pervasive computing offer rich information, which is information that includes other types of information. For example, the information listed in a pe...
Urs Hengartner, Peter Steenkiste
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
16 years 1 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
« Prev « First page 1676 / 2178 Last » Next »