Sciweavers

194 search results - page 19 / 39
» Some problems, I care most
Sort
View
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
13 years 2 days ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
15 years 4 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
77
Voted
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
15 years 10 months ago
Belief state approaches to signaling alarms in surveillance systems
Surveillance systems have long been used to monitor industrial processes and are becoming increasingly popular in public health and anti-terrorism applications. Most early detecti...
Kaustav Das, Andrew W. Moore, Jeff G. Schneider
ATAL
2005
Springer
15 years 3 months ago
Matchmaking multi-party interactions using historical performance data
Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web. Most research on matchmaking has been directed toward sophisticated ma...
David Lambert, David Robertson
71
Voted
WG
2000
Springer
15 years 1 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano