1092 search results - page 181 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
168
click to vote
COLT
2007
Springer
16 years 10 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
161
click to vote
BROADNETS
2006
IEEE
16 years 7 days ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
170
click to vote
ACSAC
2005
IEEE
15 years 11 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
163
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
151
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...