6251 search results - page 911 / 1251 » Randomness, Computability, and Density |
220
click to vote
GROUP
2007
ACM
15 years 11 months ago
2007
ACM
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
211
click to vote
ACIVS
2006
Springer
15 years 11 months ago
2006
Springer
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
214
click to vote
FOCS
2004
IEEE
15 years 11 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
218
click to vote
FOCS
2004
IEEE
15 years 11 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
170
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...