Sciweavers

3394 search results - page 35 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
IWCMC
2006
ACM
14 years 1 months ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
CCCG
2010
13 years 9 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...
DAC
2006
ACM
14 years 8 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
RT
1998
Springer
13 years 12 months ago
Three Point Clustering for Radiance Computations
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
Marc Stamminger, Philipp Slusallek, Hans-Peter Sei...
ACL
2010
13 years 5 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae