9842 search results - page 290 / 1969 » The Complexity of the Matching-Cut Problem |
134
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
151
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
124
Voted
CIAC
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
118
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
125
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...