600 search results - page 97 / 120 » Problems and results in extremal combinatorics - II |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
107
click to vote
CCS
2007
ACM
15 years 1 months ago
2007
ACM
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
AIPS
2009
14 years 10 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
SIGGRAPH
1997
ACM
15 years 1 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...