Sciweavers

491 search results - page 67 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 9 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
TIT
2008
76views more  TIT 2008»
13 years 9 months ago
A Quasi-Random Approach to Space-Time Codes
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
Keying Y. Wu, Li Ping
CN
2004
98views more  CN 2004»
13 years 9 months ago
Considering spurious timeout in proxy for improving TCP performance in wireless networks
In this paper, we introduce a new proxy that effectively prevents unnecessary retransmissions of Transmission Control Protocol data segments from flowing over a wireless link on a...
Yu-Chul Kim, Dong-Ho Cho
TVCG
2010
156views more  TVCG 2010»
13 years 7 months ago
Yet Faster Ray-Triangle Intersection (Using SSE4)
—Ray-triangle intersection is an important algorithm, not only in the field of realistic rendering (based on ray tracing), but also in physics simulation, collision detection, m...
Jirí Havel, Adam Herout
GECCO
2004
Springer
14 years 2 months ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer