Sciweavers

510 search results - page 31 / 102
» How Should We Solve Search Problems Privately
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
Integration of Agile Ontology Mapping towards NLP Search in I-SOAS
In this research paper we address the importance of Product Data Management (PDM) with respect to its contributions in industry. Moreover we also present some currently available ...
Zeeshan Ahmed, Ina Tacheva
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
14 years 1 months ago
Toward Privacy in Public Databases
Abstract. We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who...
Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam...
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
AMT
2010
Springer
269views Multimedia» more  AMT 2010»
13 years 9 months ago
User Interests: Definition, Vocabulary, and Utilization in Unifying Search and Reasoning
Abstract. Consistent description and representation method of user interests are required for personalized Web applications. In this paper, we provide a formal definition and the &...
Yi Zeng, Yan Wang, Zhisheng Huang, Danica Damljano...