Sciweavers

2434 search results - page 21 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
131
Voted
JCO
1998
136views more  JCO 1998»
15 years 1 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
CORR
2006
Springer
76views Education» more  CORR 2006»
15 years 1 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
Martin J. Wainwright
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 3 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
TDSC
2010
119views more  TDSC 2010»
14 years 8 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
ISLPED
2000
ACM
97views Hardware» more  ISLPED 2000»
15 years 6 months ago
Achieving utility arbitrarily close to the optimal with limited energy
Energy is one of the limited resources for modern systems, especially the battery-operated devices and personal digital assistants. The backlog in new technologies for more powerf...
Gang Qu, Miodrag Potkonjak