Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

Voted

ICDT
1997
ACM

88views Database» more ICDT 1997»

Discovering All Most Specific Sentences by Randomized Algorithms

15 years 6 months ago

Discovering All Most Specific Sentences by Randomized Algorithms

Download www.cs.tau.ac.il

Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluj

Real-time Traffic

Database | ICDT 1997 |

claim paper

Related Content

» Discovering class specific composite features through discriminative sampling with Swendse...

» Efficient Detection of Errors in Java Components Using Random Environment and Restarts

» Discovering local structure in gene expression data the orderpreserving submatrix problem

» A statistical mechanical interpretation of algorithmic information theory

» Discovering data quality rules

» Assessing data mining results via swap randomization

» Approximately Counting Embeddings into Random Graphs

» MultipleChoice Random Network for Server Load Balancing

» A Comparative Study of Energy Minimization Methods for Markov Random Fields

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ICDT
Authors	Dimitrios Gunopulos, Heikki Mannila, Sanjeev Saluja

Comments (0)