Sciweavers

20807 search results - page 170 / 4162
» How to read a paper
Sort
View
RECOMB
2007
Springer
16 years 6 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Privacy preservation of aggregates in hidden databases: why and how?
Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting s...
Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Cha...
ALT
2006
Springer
16 years 3 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
CSCW
2010
ACM
16 years 1 months ago
Receptionist or information kiosk: how do people talk with a robot?
The schema or mental structures that people apply towards other people has been shown to influence the way people cooperate with others. Schemas evoke behavioral scripts. In this ...
Min Kyung Lee, Sara B. Kiesler, Jodi Forlizzi
ACIIDS
2009
IEEE
122views Database» more  ACIIDS 2009»
16 years 1 months ago
How to Maximize User Satisfaction Degree in Multi-service IP Networks
—Bandwidth allocation is a fundamental problem in communication networks. With current network moving towards the Future Internet model, the problem is further intensified as net...
Huy Anh Nguyen, Tam Van Nguyen, Deokjai Choi