Sciweavers

108 search results - page 13 / 22
» Computational Discovery in Pure Mathematics
Sort
View
CSE
2009
IEEE
13 years 11 months ago
Equilibria and Efficiency Loss in Games on Networks
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
Joshua R. Davis, Zachary Goldman, Jacob Hilty, Eli...
SIGKDD
2002
83views more  SIGKDD 2002»
13 years 7 months ago
Towards Effective and Interpretable Data Mining by Visual Interaction
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
Charu C. Aggarwal
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
PACT
2009
Springer
14 years 2 months ago
Parallel FFT with Eden Skeletons
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant