Sciweavers

1538 search results - page 151 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
TRIER
2002
15 years 3 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
IJPP
2011
99views more  IJPP 2011»
14 years 10 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
JPDC
2006
185views more  JPDC 2006»
15 years 3 months ago
Commodity cluster-based parallel processing of hyperspectral imagery
The rapid development of space and computer technologies has made possible to store a large amount of remotely sensed image data, collected from heterogeneous sources. In particul...
Antonio Plaza, David Valencia, Javier Plaza, Pablo...
125
Voted
TCS
2008
15 years 3 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
15 years 10 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...