Sciweavers

7065 search results - page 1345 / 1413
» Iterative Scheduling Algorithms
Sort
View
DAC
2003
ACM
14 years 3 months ago
Force directed mongrel with physical net constraints
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
Sung-Woo Hur, Tung Cao, Karthik Rajagopal, Yegna P...
IWCMC
2009
ACM
14 years 2 months ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
FSTTCS
2009
Springer
14 years 2 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
FGR
2000
IEEE
230views Biometrics» more  FGR 2000»
14 years 2 months ago
A Robust Model-Based Approach for 3D Head Tracking in Video Sequences
We present a generic and robust method for model-based global 3D head pose estimation in monocular and non-calibrated video sequences. The proposed method relies on a 3D/2D matchi...
Marius Malciu, Françoise J. Prêteux
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
14 years 2 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
« Prev « First page 1345 / 1413 Last » Next »