21324 search results - page 260 / 4265 » Making the case for computing |
80
Voted
DM
2002
15 years 3 months ago
2002
An approach to the computations of upper bounds on the size of large complete arcs is presented. In particular, we obtain geometrical properties of irreducible envelopes associated...
154
click to vote
TSE
2010
14 years 10 months ago
2010
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
122
click to vote
FC
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can...
112
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
Due to their computational efficiency and strong empirical performance, semidefinite relaxation (SDR)–based algorithms have gained much attention in multiple–input multiple...
146
click to vote
RTCSA
2009
IEEE
15 years 11 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...