1566 search results - page 125 / 314 » On a Cone Covering Problem |
188
click to vote
TACAS
2012
Springer
14 years 2 months ago
2012
Springer
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
192
click to vote
AAAI
2012
13 years 8 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
168
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
149
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
190
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...