6393 search results - page 296 / 1279 » Randomized Algorithms on the Mesh |
183
click to vote
ISCIS
2005
Springer
16 years 4 days 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...
190
click to vote
MFCS
2005
Springer
16 years 4 days 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...
174
click to vote
SAT
2005
Springer
16 years 3 days 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...
169
click to vote
ICPR
2000
IEEE
15 years 11 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 ...
183
click to vote
IDA
1999
Springer
15 years 11 months ago
1999
Springer
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...