Sciweavers

7557 search results - page 1455 / 1512
» Constraints as a design pattern
Sort
View
RECOMB
2005
Springer
15 years 11 months ago
Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
Chen Yanover, Tomer Hertz
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 11 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 11 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
VLDB
2004
ACM
128views Database» more  VLDB 2004»
15 years 11 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
15 years 11 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
« Prev « First page 1455 / 1512 Last » Next »