2137 search results - page 401 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
122
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
114
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
227
click to vote
LCC
1994
15 years 6 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
159
click to vote
SIGIR
2012
ACM
13 years 4 months ago
2012
ACM
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
114
click to vote
TMC
2008
15 years 1 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...