SDM
2012
SIAM
12 years 1 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
FSE
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
EGH
2009
Springer
13 years 8 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...
JAL
2002
13 years 10 months ago
2002
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
PODC
2010
ACM
14 years 25 days ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
ISSAC
1999
Springer
14 years 3 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
ICTAI
2007
IEEE
14 years 5 months ago
2007
IEEE
We propose in this paper a generic algorithm based on Ant Colony Optimization to solve multi-objective optimization problems. The proposed algorithm is parameterized by the number...