Sciweavers

3270 search results - page 58 / 654
» Approximate String Processing
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 3 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 2 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
ICML
2010
IEEE
14 years 11 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
CIDR
2003
163views Algorithms» more  CIDR 2003»
14 years 11 months ago
Query Processing, Approximation, and Resource Management in a Data Stream Management System
This paper describes our ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams. The ST...
Rajeev Motwani, Jennifer Widom, Arvind Arasu, Bria...