Sciweavers

6575 search results - page 1028 / 1315
» Specializing visualization algorithms
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 2 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
JMIV
2007
92views more  JMIV 2007»
15 years 2 months ago
Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency
There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depend...
Romaric Audigier, Roberto de Alencar Lotufo
177
Voted
TKDE
2002
148views more  TKDE 2002»
15 years 2 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
MP
2007
145views more  MP 2007»
15 years 2 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
PR
2007
100views more  PR 2007»
15 years 2 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
« Prev « First page 1028 / 1315 Last » Next »