973 search results - page 104 / 195 » New Bounds on Crossing Numbers |
169
click to vote
ICMCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Network-based real-time multimedia applications require guaranteed performance communicationservices. To provide guaranteed service, resources have to be reserved within the netwo...
179
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
136
click to vote
AAAI
2008
15 years 8 months ago
2008
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
162
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
195
click to vote
CSREASAM
2009
15 years 7 months ago
2009
In this paper we propose a new designated verifier signature scheme based on the threshold signature scheme presented [8] by Ghodosi and Pieprzyk. The advantages of the new scheme ...