Sciweavers

11328 search results - page 58 / 2266
» Timed Branching Processes
Sort
View
CP
2009
Springer
16 years 3 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
16 years 3 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
IPPS
2005
IEEE
15 years 8 months ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
3DIM
2003
IEEE
15 years 8 months ago
Effective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
Ryusuke Sagawa, Tomohito Masuda, Katsushi Ikeuchi
WABI
2001
Springer
15 years 7 months ago
A Chemical-Distance-Based Test for Positive Darwinian Selection
There are very few instances in which positive Darwinian selection has been convincingly demonstrated at the molecular level. In this study, we present a novel test for detecting p...
Tal Pupko, Roded Sharan, Masami Hasegawa, Ron Sham...