Sciweavers

67 search results - page 9 / 14
» When Ambients Cannot Be Opened
Sort
View
PAA
2002
13 years 7 months ago
Combining Discriminant Models with New Multi-Class SVMs
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
Yann Guermeur
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
DGCI
2009
Springer
13 years 11 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
ICNP
2007
IEEE
14 years 2 months ago
Design and Implementation of Cross-Domain Cooperative Firewall
Security and privacy are two major concerns in supporting roaming users across administrative domains. In current practices, a roaming user often uses encrypted tunnels, e.g., Virt...
Jerry Cheng, Hao Yang, Starsky H. Y. Wong, Petros ...
NDSS
2006
IEEE
14 years 1 months ago
Trust Negotiation with Hidden Credentials, Hidden Policies, and Policy Cycles
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather tha...
Keith B. Frikken, Jiangtao Li, Mikhail J. Atallah