2745 search results - page 277 / 549 » A fast algorithm for computing large Fibonacci numbers |
155
Voted
KDD
1999
ACM
15 years 9 months ago
1999
ACM
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
150
click to vote
VTC
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Careful modeling of the radio channel characteristics is an important issue for system level simulations. While a number of detailed path loss, shadowing and fast fading...
113
click to vote
WECWIS
2003
IEEE
15 years 10 months ago
2003
IEEE
Markets with time dependent goods are special cases of multi commodity markets.The design of large flexible markets with time dependent goods is a computational challenge. In thi...
146
click to vote
CGA
2008
15 years 5 months ago
2008
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...
193
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...