1046 search results - page 89 / 210 » Approximation Algorithms for Domination Search |
118
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
141
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
152
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
131
click to vote
WIDM
2006
ACM
15 years 9 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
120
click to vote
TSP
2010
14 years 9 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...