Sciweavers

2080 search results - page 178 / 416
» Measuring empirical computational complexity
Sort
View
CVPR
2010
IEEE
16 years 1 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
169
Voted
APVIS
2010
15 years 6 months ago
Physically-based interactive schlieren flow visualization
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
Carson Brownlee, Vincent Pegoraro, Singer Shankar,...
135
Voted
BMCBI
2008
130views more  BMCBI 2008»
15 years 5 months ago
FAF-Drugs2: Free ADME/tox filtering tool to assist drug discovery and chemical biology projects
Background: Drug discovery and chemical biology are exceedingly complex and demanding enterprises. In recent years there are been increasing awareness about the importance of pred...
David Lagorce, Olivier Sperandio, Hervé Gal...
CLUSTER
2005
IEEE
15 years 10 months ago
A Feasibility Analysis of Power Awareness in Commodity-Based High-Performance Clusters
We present a feasibility study of a power-reduction scheme that reduces the thermal power of processors by lowering frequency and voltage in the context of high-performance comput...
Chung-Hsing Hsu, Wu-chun Feng
ICDCS
2000
IEEE
15 years 9 months ago
Task Assignment with Unknown Duration
We consider a distributed server system and ask which policy should be used for assigning tasks to hosts. In our server, tasks are not preemptible. Also, the task's service d...
Mor Harchol-Balter