Sciweavers

400 search results - page 63 / 80
» What Makes a Problem GP-Hard
Sort
View
RECSYS
2009
ACM
14 years 1 months ago
Conceptual recommender system for CiteSeerX
Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
Ajith Kodakateri Pudhiyaveetil, Susan Gauch, Hiep ...
WPES
2003
ACM
14 years 20 days 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...
DESRIST
2009
Springer
79views Education» more  DESRIST 2009»
14 years 1 days ago
Power of peripheral designers: how users learn to design
In information system development, end-users often participate in design and in many cases learn to design their own system. Design, however, requires a distinct approach that use...
Yutaka Yamauchi
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 10 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi