Sciweavers

1982 search results - page 296 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
142
Voted
SIGSOFT
1994
ACM
15 years 6 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 3 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
112
Voted
ACG
2003
Springer
15 years 8 months ago
Searching with Analysis of Dependencies in a Solitaire Card Game
We present a new method for taking advantage of the relative independence between parts of a single-player game. We describe an implementation for improving the search in a solitai...
Bernard Helmstetter, Tristan Cazenave
169
Voted
VLDB
2002
ACM
116views Database» more  VLDB 2002»
15 years 2 months ago
Watermarking Relational Databases
We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking,...
Rakesh Agrawal, Jerry Kiernan
104
Voted
BMCBI
2006
124views more  BMCBI 2006»
15 years 2 months ago
Detection of divergent genes in microbial aCGH experiments
Background: Array-based comparative genome hybridization (aCGH) is a tool for rapid comparison of genomes from different bacterial strains. The purpose of such analysis is to dete...
Lars Snipen, Dirk Repsilber, Ludvig Nyquist, &Arin...