Sciweavers

3257 search results - page 55 / 652
» Some Results on Effective Randomness
Sort
View
CSR
2009
Springer
14 years 4 months ago
On Random Ordering Constraints
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Andreas Goerdt
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 11 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
13 years 11 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
DATE
2009
IEEE
92views Hardware» more  DATE 2009»
14 years 4 months ago
Using randomization to cope with circuit uncertainty
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...
Hamid Safizadeh, Mohammad Tahghighi, Ehsan K. Arde...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 4 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...