Sciweavers

16404 search results - page 911 / 3281
» A set coverage problem
Sort
View
PODC
2010
ACM
15 years 9 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom
CSREASAM
2006
15 years 9 months ago
An Efficient Bloom Filter Based Solution for Multiparty Private Matching
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...
Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. ...
DAM
2007
153views more  DAM 2007»
15 years 7 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
JVCA
2006
140views more  JVCA 2006»
15 years 7 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
ML
2006
ACM
121views Machine Learning» more  ML 2006»
15 years 7 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung