2040 search results - page 105 / 408 » Approximate Expectation Maximization |
113
click to vote
EWSN
2011
Springer
14 years 3 months ago
2011
Springer
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
101
click to vote
SSDBM
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
100
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
JGAA
2000
14 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
134
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...