Sciweavers

2100 search results - page 152 / 420
» Fundamentals of the problem
Sort
View
170
Voted
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
15 years 10 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
170
Voted
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 10 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 9 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
CVPR
2010
IEEE
15 years 8 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
CSREASAM
2006
15 years 7 months ago
An Efficient Bloom Filter Based Solution for Multiparty Private Matching
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...
Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. ...