5580 search results - page 186 / 1116 » Randomized priority algorithms |
118
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
91
Voted
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
86
Voted
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper looks at the nonparametric, multiscale, Markov Random Field (MRF) model and its application in classifying the MeasTex Test Suite. The MeasTex Test Suite is a standard ...