Sciweavers

188 search results - page 28 / 38
» The 2-center problem in three dimensions
Sort
View
JVCA
2006
140views more  JVCA 2006»
13 years 9 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
MANSCI
2011
13 years 4 months ago
Organizational Change and Employee Stress
This article analyzes the relationship between organizational change and employee health. It illuminates the potentially negative outcomes of change at the level of the employee. ...
Michael S. Dahl
VLSISP
2011
358views Database» more  VLSISP 2011»
13 years 4 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...
FOCS
2002
IEEE
14 years 2 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 4 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...