Sciweavers

3598 search results - page 164 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
CGI
2003
IEEE
15 years 11 months ago
"Nijimi" Rendering Algorithm for Creating Quality Black Ink Paintings
The paper presents an interactive painting system for generating high quality and artistic calligraphy characters and black ink paintings. The system is based on our original algo...
Qinglian Guo, Tosiyasu L. Kunii
COMPGEOM
2000
ACM
15 years 10 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
HICSS
2007
IEEE
109views Biometrics» more  HICSS 2007»
16 years 15 days ago
Towards Reliable Computation of Large-Scale Market-Based Optimal Power Flow
The deregulated electricity market calls for robust OPF tools that can provide (a) deterministic convergence, (b) accurate computation of a variety of nodal prices, (c) support of...
Hongye Wang, Robert J. Thomas
CCGRID
2008
IEEE
16 years 19 days ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni