Sciweavers

1064 search results - page 69 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
135
Voted
DAM
2007
100views more  DAM 2007»
15 years 4 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 9 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
GD
2005
Springer
15 years 9 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
ICIP
2001
IEEE
16 years 5 months ago
On the estimation of spectral data: a genetic algorithm approach
Spectral data estimation from image data is an ill-posed problem since (i) due to the integral nature of solid-state light sensors the same output can be obtained from an infinity...
Amâncio Santos, António Dourado, Bern...
SMA
2008
ACM
157views Solid Modeling» more  SMA 2008»
15 years 4 months ago
Interactive physically-based shape editing
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...
Johannes Mezger, Bernhard Thomaszewski, Simon Pabs...