1469 search results - page 245 / 294 » Approximate polynomial decomposition |
PODC
2009
ACM
16 years 13 days ago
2009
ACM
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
109
click to vote
ICALP
2009
Springer
16 years 5 days ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
195
Voted
VLDB
2007
ACM
16 years 3 days ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...