500 search results - page 51 / 100 » Approximation algorithms for maximum independent set of pseu... |
119
click to vote
ALENEX
2008
15 years 3 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
106
Voted
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
107
Voted
CPC
2006
15 years 1 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
100
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
117
click to vote
DAM
2008
15 years 1 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...