Sciweavers

4126 search results - page 481 / 826
» Relationships with other Formalisms
Sort
View
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
16 years 3 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
HICSS
2009
IEEE
189views Biometrics» more  HICSS 2009»
16 years 1 months ago
Predicting Change: A Study of the Value Frequency Model for Change of Practice
Information systems (IS) researchers have made considerable progress on defining and formalizing structured methods to support collaborative development of information systems. Co...
Robert O. Briggs, John D. Murphy, Thomas F. Carlis...
IWANN
2009
Springer
16 years 1 months ago
Identifying Gene Ontology Areas for Automated Enrichment
Biomedical ontologies provide a commonly accepted scheme for the characterization of biological concepts that enable knowledge sharing and integration. Updating and maintaining an ...
Catia Pesquita, Tiago Grego, Francisco M. Couto
169
Voted
SIGIR
2009
ACM
16 years 1 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
16 years 1 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng