Sciweavers

6299 search results - page 1097 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
EDBT
2000
ACM
15 years 10 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 10 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
ECAI
2008
Springer
15 years 8 months ago
A probabilistic trust model for semantic peer-to-peer systems
Semantic peer to peer (P2P) systems are fully decentralized overlay networks of people or machines (called peers) sharing and searching varied resources (documents, videos, photos...
Gia Hien Nguyen, Philippe Chatalic, Marie-Christin...
INFOSCALE
2007
ACM
15 years 8 months ago
An agent-based decentralised process management framework for web service composition
Web service composition provision which requires efficient coordination of the execution of component services is a critical issue in service-oriented computing. Nowadays, BPEL4WS...
Jun Yan, Phillip Pidgeon, Aneesh Krishna, Jianming...
BIOCOMP
2007
15 years 8 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
« Prev « First page 1097 / 1260 Last » Next »