4903 search results - page 652 / 981 » The Set Covering Machine |
169
click to vote
ALT
2000
Springer
15 years 11 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
174
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
175
click to vote
EUROSYS
2010
ACM
15 years 10 months ago
2010
ACM
When a performance crisis occurs in a datacenter, rapid recovery requires quickly recognizing whether a similar incident occurred before, in which case a known remedy may apply, o...
155
Voted
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
In most existing systems, the authorization check for system resource access is based on the user ID of the running processes. Such systems are vulnerable to password stealing/cra...
195
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...