531 search results - page 73 / 107 » A Better Algorithm for Random k-SAT |
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
MICRO
2006
IEEE
14 years 3 months ago
2006
IEEE
We present and evaluate the idea of adaptive processor cache management. Specifically, we describe a novel and general scheme by which we can combine any two cache management alg...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
SIGIR
2006
ACM
14 years 3 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...