Sciweavers

2095 search results - page 230 / 419
» Improved pebbling bounds
Sort
View
SIGGRAPH
2009
ACM
16 years 1 months ago
PCCD: parallel continuous collision detection
We present a novel parallel continuous collision detection (PCCD) method to utilize the widely available multi-core CPU architecture. Our method works with a wide variety of defor...
Duksu Kim, Jae-Pil Heo, Sung-Eui Yoon
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
16 years 1 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
ATAL
2007
Springer
16 years 24 days ago
Integrating authority, deontics, and communications within a joint intention framework
Many agents are fielded within environments requiring modeling traditional organizational structures such as military hierarchies and corporations, with their associated authority...
Marcus J. Huber, Sanjeev Kumar, David McGee, Sean ...
HPDC
2005
IEEE
16 years 7 days ago
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol
Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available re...
Kfir Karmon, Liran Liss, Assaf Schuster
ICALP
2005
Springer
16 years 4 days ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz