Sciweavers

3600 search results - page 17 / 720
» The settling-time reducibility ordering
Sort
View
WSC
1998
13 years 9 months ago
Sequential Allocations that Reduce Risk for Multiple Comparisons
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
Stephen E. Chick, Koichiro Inoue
CCS
2010
ACM
13 years 6 months ago
A control point for reducing root abuse of file-system privileges
We address the problem of restricting root’s ability to change arbitrary files on disk, in order to prevent abuse on most current desktop operating systems. The approach first...
Glenn Wurster, Paul C. van Oorschot
WEBI
2010
Springer
13 years 5 months ago
Reducing the Cold-Start Problem in Content Recommendation through Opinion Classification
Like search engines, recommender systems have become a tool that cannot be ignored by websites with a large selection of products, music, news or simply webpages links. The perform...
Damien Poirier, Françoise Fessant, Isabelle...
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
14 years 1 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
14 years 26 days ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt