Sciweavers

2303 search results - page 377 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
102
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 2 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
CLUSTER
2008
IEEE
15 years 9 months ago
Magnet: A novel scheduling policy for power reduction in cluster with virtual machines
—The concept of green computing has attracted much attention recently in cluster computing. However, previous local approaches focused on saving the energy cost of the components...
Liting Hu, Hai Jin, Xiaofei Liao, Xianjie Xiong, H...
CG
2008
Springer
15 years 2 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
ICCV
2003
IEEE
16 years 4 months ago
Cumulative Residual Entropy, A New Measure of Information & its Application to Image Alignment
In this paper we use the cumulative distribution of a random variable to define the information content in it and use it to develop a novel measure of information that parallels S...
Fei Wang, Baba C. Vemuri, Murali Rao, Yunmei Chen
MM
2009
ACM
196views Multimedia» more  MM 2009»
15 years 9 months ago
Mirror world navigation for mobile users based on augmented reality
Finding a destination in unfamiliar environments of complex office building or shopping mall has been always bothering us in daily life. Fine-scale directional guidance, a combina...
Patricia P. Wang, Tao Wang, Dayong Ding, Yimin Zha...