2168 search results - page 229 / 434 » Randomized Algorithms and Complexity Theory |
237
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
144
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
109
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ...
135
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present an advanced bidding agent that participates in first-price sealed bid auctions to allocate advertising space on BluScreen – an experimental public adve...
116
Voted
SMA
2005
ACM
15 years 9 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...