1389 search results - page 115 / 278 » Improved Approximation Algorithms for Label Cover Problems |
136
Voted
NETWORKS
2011
14 years 10 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
137
click to vote
ICTAI
2009
IEEE
15 years 29 days ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
176
click to vote
SODA
2007
ACM
15 years 4 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
136
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
219
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...