Sciweavers

831 search results - page 18 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 2 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
BMCBI
2005
169views more  BMCBI 2005»
13 years 7 months ago
Genetic interaction motif finding by expectation maximization - a novel statistical model for inferring gene modules from synthe
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
Yan Qi 0003, Ping Ye, Joel S. Bader
ICPADS
2006
IEEE
14 years 1 months ago
OBN: Peering for Finding Suppliers in P2P On-demand Streaming Systems
A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimiza...
Chi-Shiang Liao, Wen-Hung Sun, Chung-Ta King, Hung...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 2 days ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
DICTA
2003
13 years 9 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung