Sciweavers

1921 search results - page 195 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
143
Voted
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 2 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
114
Voted
DCC
2005
IEEE
16 years 2 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...
126
Voted
ICNP
2005
IEEE
15 years 8 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
IMR
2003
Springer
15 years 7 months ago
Combined Laplacian and Optimization-based Smoothing for Quadratic Mixed Surface Meshes
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
Zhijian Chen, Joseph R. Tristano, Wa Kwok
122
Voted
AAAI
2004
15 years 4 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...