Sciweavers

2745 search results - page 69 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
146
Voted
CIE
2007
Springer
15 years 9 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
INFOCOM
2007
IEEE
15 years 9 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin
127
Voted
ADHOCNOW
2004
Springer
15 years 9 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
DAC
2006
ACM
16 years 4 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
157
Voted
ICIP
2009
IEEE
16 years 4 months ago
Learning Large Margin Likelihoods For Realtime Head Pose Tracking
We consider the problem of head tracking and pose estimation in realtime from low resolution images. Tracking and pose recognition are treated as two coupled problems in a probabi...