7167 search results - page 903 / 1434 » Answer Set Programming |
149
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
141
click to vote
SI3D
2009
ACM
15 years 11 months ago
2009
ACM
Populating virtual environments (VEs) with large crowds is a subject that has been tackled for several years. Solutions have been proposed to offer realistic trajectories as well ...
146
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
142
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...