Sciweavers

1291 search results - page 24 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya
ESA
2007
Springer
93views Algorithms» more  ESA 2007»
14 years 1 months ago
Polynomial Time Algorithms for Minimum Energy Scheduling
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
Philippe Baptiste, Marek Chrobak, Christoph Dü...
ECCV
2006
Springer
14 years 9 months ago
Tracking and Labelling of Interacting Multiple Targets
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...
Josephine Sullivan, Stefan Carlsson
COMGEO
2007
ACM
13 years 7 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
BIRTHDAY
2009
Springer
14 years 2 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...