2252 search results - page 299 / 451 » Lower Bounds for Dynamic Algorithms |
140
Voted
ICCAD
2010
IEEE
15 years 25 days ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
143
Voted
ALGORITHMICA
2011
14 years 10 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
143
Voted
MST
2011
14 years 10 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
102
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...
121
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Received signal strength (RSS) based source localization papers often ignore the practical effects of range limits in the measurements. In many devices, this results in some senso...