319 search results - page 50 / 64 » Cryptographic Assumptions: A Position Paper |
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift in...
ACSAC
2005
IEEE
15 years 3 months ago
2005
IEEE
An increasing variety of malware, such as worms, spyware and adware, threatens both personal and business computing. Remotely controlled bot networks of compromised systems are gr...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
83
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...