16404 search results - page 3059 / 3281 » A set coverage problem |
179
Voted
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 producti...
160
Voted
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
163
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
162
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
151
Voted
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...