Sciweavers

56 search results - page 9 / 12
» Quadratic Placement Revisited
Sort
View
GD
2005
Springer
14 years 27 days 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
ICASSP
2008
IEEE
14 years 1 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
HPDC
2006
IEEE
14 years 1 months ago
Filecules in High-Energy Physics: Characteristics and Impact on Resource Management
Grid computing has reached the stage where deployments are mature and many collaborations run in production mode. Mature Grid deployments offer the opportunity for revisiting and ...
Adriana Iamnitchi, Shyamala Doraimani, Gabriele Ga...
SIGPLAN
2008
13 years 7 months ago
Injecting programming language concepts throughout the curriculum: an inclusive strategy
As research in programming language design, implementation, and application advances, we must regularly revisit the undergraduate curriculum to ensure course content advances simi...
Mark W. Bailey