5115 search results - page 137 / 1023 » On Randomized Lanczos Algorithms |
163
click to vote
SAT
2005
Springer
15 years 12 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...
167
click to vote
ICPR
2000
IEEE
15 years 10 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 ...
173
click to vote
IDA
1999
Springer
15 years 10 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...
177
click to vote
WSC
2008
15 years 8 months ago
2008
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
177
click to vote
AINA
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...