Sciweavers

2642 search results - page 387 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
WPES
2003
ACM
14 years 2 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
CIKM
2009
Springer
14 years 1 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
CP
2006
Springer
14 years 1 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
DLOG
2001
13 years 10 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
WISE
2009
Springer
14 years 6 months ago
Start Trusting Strangers? Bootstrapping and Prediction of Trust
Web-based environments typically span interactions between humans and software services. The management and automatic calculation of trust are among the key challenges of the futur...
Florian Skopik, Daniel Schall, Schahram Dustdar