Sciweavers

3630 search results - page 291 / 726
» Fast Marching Methods
Sort
View
SPAA
1997
ACM
15 years 10 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
SIGGRAPH
1994
ACM
15 years 10 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
182
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 10 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
GLVLSI
2009
IEEE
143views VLSI» more  GLVLSI 2009»
15 years 10 months ago
Unified P4 (power-performance-process-parasitic) fast optimization of a Nano-CMOS VCO
In this paper, we present the design of a P4 (Power-PerformanceProcess-Parasitic) aware voltage controlled oscillator (VCO) at nanoCMOS technologies. Through simulations, we have ...
Dhruva Ghai, Saraju P. Mohanty, Elias Kougianos