Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,884
Efficient noise-tolerant learning from statistical queries
- JOURNAL OF THE ACM
, 1998
"... In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the class of “robust” learning algorithms in the most general way, we formalize a new but related model of learning from stat ..."
Abstract
-
Cited by 353 (5 self)
- Add to MetaCart
’s model and its variants can also be learned in the new model (and thus can be learned in the presence of noise). A notable exception to this statement is the class of parity functions, which we prove is not learnable from statistical queries, and for which no noise-tolerant algorithm is known.
A large-scale study of the evolution of web pages
- In Proceedings of the 12th International World Wide Web Conference
, 2003
"... How fast does the web change? Does most of the content remain unchanged once it has been authored, or are the documents continuously updated? Do pages change a little or a lot? Is the extent of change correlated to any other property of the page? All of these questions are of interest to those who m ..."
Abstract
-
Cited by 241 (5 self)
- Add to MetaCart
mine the web, including all the popular search engines, but few studies have been performed to date to answer them. One notable exception is a study by Cho and Garcia-Molina, who crawled a set of 720,000 pages on a daily basis over four months, and counted pages as having changed if their MD5 checksum
Notable Features of MALIBNET
"... This paper gives a detailed account of the objectives, structure, products, services of MALIBNET, its linkages with INSDOC and the users of the Network. MALIBNET is claimed to be a model network which has become operational in a short span of four months after it is registered as a society and that ..."
Abstract
- Add to MetaCart
and that too without government support except that of INSDOC. The need for interconnecting libraries in Madras was visualised by Indian National Scientific Documentation Centre (IP4SDOC) in 1991. The centre undertook a feasibility study, which was partially funded by NISSAT. The study was completed in March i
The two general activation systems of affect: Structural findings, evolutionary considerations, and psychobiological evidence
- Journal of Personality and Social Psychology
, 1999
"... D. Watson and A. Tellegen (19X5') proposed a "consensual " structure of affect based on J. A. Russell's (1980) circumplcx. The authors " review of the literature indicates that this 2-factor model captures robust structural properties of self-rated mood. Nevertheless, the ev ..."
Abstract
-
Cited by 250 (3 self)
- Add to MetaCart
, the evidence also indicates that the circumplcx does not fit the data closely and needs to be refined. Most notably, the model's dimensions are not entirely independent: moreover, with the exception of Pleasantness—Unpleasantness, they are not completely bipolar. More generally, the data suggest a model
TENSOR RANK AND THE ILL-POSEDNESS OF THE BEST LOW-RANK APPROXIMATION PROBLEM
"... There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher, that parallels the Eckart–Young theorem for matrices. In this paper, we argue that the naive approach to this problem is doomed to failure because, unlike matrices, te ..."
Abstract
-
Cited by 194 (13 self)
- Add to MetaCart
, we show that in many instances these counterexamples have positive volume: they cannot be regarded as isolated phenomena. In one extreme case, we exhibit a tensor space in which no rank-3 tensor has an optimal rank-2 approximation. The notable exceptions to this misbehavior are rank-1 tensors
Cytochemistry and electron microscopy. The preservation of cellular ultrastructure and enzymatic activity by aldehyde fixation
- J. Cell Biol
"... The aldehydes introduced in this paper and the more appropriate concentrations for their general use as fixatives are: 4 to 6.5 per cent glutaraldehyde, 4 per cent glyoxal, 12.5 per cent hydroxyadipaldehyde, 10 per cent crotonaldehyde, 5 per cent pyruvic aldehyde, 10 per cent acetaldehyde, and 5 per ..."
Abstract
-
Cited by 202 (1 self)
- Add to MetaCart
per cent methacrolein. These were prepared as cacodylateor phosphate-buffered solutions (0.1 to 0.2 M, pH 6.5 to 7.6) that, with the exception of glutaraldehyde, contained sucrose (0.22 to 0.55 M). After fixation of from 0.5 hour to 24 hours, the blocks were stored in cold (4°C) buffer (0.1 M) plus
Experimental Results on the Crossover Point in Random 3sat
- Artificial Intelligence
, 1996
"... Determining whether a propositional theory is satisfiable is a prototypical example of an NP-complete problem. Further, a large number of problems that occur in knowledge-representation, learning, planning, and other ares of AI are essentially satisfiability problems. This paper reports on the most ..."
Abstract
-
Cited by 142 (6 self)
- Add to MetaCart
extensive set of experiments to date on the location and nature of the cross-over point in satisfiability problems. These experiments generally confirm previous results with two notable exceptions. First, we have found that neither of the functions previously proposed accurately models the location
Introduction: On Indigenous Education
"... There have been notable exceptions of various scope and scale – the ongoing development of Maori education, the numerous community‐based and bicultural ..."
Abstract
- Add to MetaCart
There have been notable exceptions of various scope and scale – the ongoing development of Maori education, the numerous community‐based and bicultural
A fast bit-vector algorithm for approximate string matching based on dynamic programming
- J. ACM
, 1999
"... Abstract. The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in agrep. These alg ..."
Abstract
-
Cited by 185 (1 self)
- Add to MetaCart
Abstract. The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in agrep
Exceptional model mining.
- In Machine Learning and Knowledge Discovery in Databases,
, 2008
"... Abstract. In most databases, it is possible to identify small partitions of the data where the observed distribution is notably different from that of the database as a whole. In classical subgroup discovery, one considers the distribution of a single nominal attribute, and exceptional subgroups sh ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
Abstract. In most databases, it is possible to identify small partitions of the data where the observed distribution is notably different from that of the database as a whole. In classical subgroup discovery, one considers the distribution of a single nominal attribute, and exceptional subgroups
Results 1 - 10
of
1,884
