Sciweavers

2924 search results - page 478 / 585
» Lower Bounds in Distributed Computing
Sort
View
CPAIOR
2008
Springer
15 years 6 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
CVGIP
2010
182views more  CVGIP 2010»
15 years 4 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong
CORR
2011
Springer
195views Education» more  CORR 2011»
14 years 11 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...
CLUSTER
2007
IEEE
15 years 10 months ago
Thermal-aware task scheduling for data centers through minimizing heat recirculation
— The thermal environment of data centers plays a significant role in affecting the energy efficiency and the reliability of data center operation. A dominant problem associate...
Qinghui Tang, Sandeep K. S. Gupta, Georgios Varsam...
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
16 years 5 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...