Sciweavers

116 search results - page 11 / 24
» A New Intersection Model and Improved Algorithms for Toleran...
Sort
View
CGF
1999
125views more  CGF 1999»
13 years 7 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
DAC
2008
ACM
14 years 8 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
SIGIR
2009
ACM
14 years 2 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
ECCV
2010
Springer
14 years 24 days ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...