Sciweavers

3341 search results - page 221 / 669
» On Bounded Queries and Approximation
Sort
View
ICFCA
2007
Springer
16 years 23 days ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
ISVC
2007
Springer
16 years 23 days ago
Image Compression Using Data-Dependent Triangulations
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
Burkhard Lehner, Georg Umlauf, Bernd Hamann
ECRTS
2004
IEEE
15 years 10 months ago
Multiprocessor Energy-Efficient Scheduling with Task Migration Considerations
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...
Jian-Jia Chen, Heng-Ruey Hsu, Kai-Hsiang Chuang, C...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
JCO
2010
169views more  JCO 2010»
15 years 5 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu