Sciweavers

510 search results - page 35 / 102
» How Should We Solve Search Problems Privately
Sort
View
WAIM
2010
Springer
13 years 5 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
CHI
2010
ACM
14 years 2 months ago
Interactive effects of age and interface differences on search strategies and performance
We present results from an experiment that studied the information search behavior of younger and older adults in a medical decision-making task. To study how different combinatio...
Jessie Chin, Wai-Tat Fu
SDM
2008
SIAM
135views Data Mining» more  SDM 2008»
13 years 9 months ago
Preemptive Measures against Malicious Party in Privacy-Preserving Data Mining
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
Shuguo Han, Wee Keong Ng
CORR
2011
Springer
133views Education» more  CORR 2011»
12 years 11 months ago
Minimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
Florian Bugarin, Didier Henrion, Jean B. Lasserre
CP
1998
Springer
13 years 11 months ago
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
Daniel Frost, Rina Dechter