16404 search results - page 2995 / 3281 » A set coverage problem |
137
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
131
click to vote
VLSI
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we present the way of fast and accurate estimation of software energy consumption in off-the-shelf processor using IPI(Inter-Prefetch Interval) energy model. In ou...
173
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
144
Voted
WINE
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
150
click to vote
BIBE
2006
IEEE
15 years 11 months ago
2006
IEEE
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...