219 search results - page 17 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
117
click to vote
AAAI
2010
15 years 2 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
141
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
102
click to vote
AAAI
1997
15 years 2 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
114
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
115
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...