9842 search results - page 1370 / 1969 » The Complexity of the Matching-Cut Problem |
301
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
291
click to vote
GIS
2006
ACM
16 years 8 months ago
2006
ACM
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
259
click to vote
DAC
2005
ACM
16 years 8 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
166
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
289
click to vote
ICDT
2009
ACM
16 years 8 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...