1272 search results - page 129 / 255 » The Set Cover with Pairs Problem |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot o...
COLT
2006
Springer
14 years 2 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
EDBT
2004
ACM
14 years 11 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
GEOINFO
2004
14 years 5 days ago
2004
: Urban planning is a very important issue to guarantee the sustainable development of modern towns. Many aspects must be considered and one of the most important is the population...