2314 search results - page 260 / 463 » Monoids over domains |
169
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
193
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralised coordination in multi-agent systems is typically achieved using communication. However, in many cases, communication is expensive to utilise because there is limited...
203
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
169
click to vote
SIGMETRICS
2009
ACM
16 years 1 months ago
2009
ACM
Accurately identifying spam campaigns launched by a large number of bots in a botnet allows for accurate spam campaign signature generation and hence is critical to defeating spam...
201
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...