9849 search results - page 317 / 1970 » Algorithms and Experiments for the Webgraph |
184
click to vote
AAAI
1996
15 years 8 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
126
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
212
click to vote
EGH
2009
Springer
15 years 5 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
236
click to vote
WWW
2011
ACM
15 years 2 months ago
2011
ACM
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...
185
click to vote
TVCG
2010
15 years 2 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...