• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,331
Next 10 →

Studying information technology in organizations: Research approaches and assumptions

by Wanda J. Orlikowski, Jack J. Baroudi - Information Systems Research , 1991
"... We examined 155 information systems research articles published from 1983 to 1988 and found that although this research is not rooted in a single overarching theoretical perspective, it does exhibit a single set of philosophical assumptions regarding the nature of the phenomena studied by informatio ..."
Abstract - Cited by 463 (2 self) - Add to MetaCart
by information systems researchers, and what constitutes valid knowledge about those phenomena. We believe that a single research perspective for studying information systems phenomena is unnecessarily restrictive, and argue that there exist other philosophical assumptions that can inform studies

An analysis of transformations

by G. E. P. Box, D. R. Cox - Journal of the Royal Statistical Society. Series B (Methodological , 1964
"... In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal, homoscedasti ..."
Abstract - Cited by 1067 (3 self) - Add to MetaCart
In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal

On combining classifiers

by Josef Kittler, Mohamad Hatef, Robert P. W. Duin, Jiri Matas - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1998
"... We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental ..."
Abstract - Cited by 1420 (33 self) - Add to MetaCart
. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions—the sum rule—outperforms other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show

Articulated body motion capture by annealed particle filtering

by Jonathan Deutscher, Andrew Blake, Ian Reid - In IEEE Conf. on Computer Vision and Pattern Recognition , 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract - Cited by 494 (4 self) - Add to MetaCart
is to introduce constraints — either labelling using markers or colour coding, prior assumptions about motion trajectories or view restrictions. Another is to relax constraints arising from articulation, and track limbs as if their motions were independent. In contrast, here we aim for general tracking without

Coupled hidden Markov models for complex action recognition

by Matthew Brand, Nuria Oliver, Alex Pentland , 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying two-handed actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract - Cited by 501 (22 self) - Add to MetaCart
and classifying dynamic behaviors, popular because they offer dynamic time warping, a training algorithm, and a clear Bayesian semantics. However, the Markovian framework makes strong restrictive assumptions about the system generating the signal---that it is a single process having a small number of states

Bayesian Network Classifiers

by Nir Friedman, Dan Geiger, Moises Goldszmidt , 1997
"... Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with state-of-the-art classifiers such as C4.5. This fact raises the question of whether a classifier with less restr ..."
Abstract - Cited by 796 (20 self) - Add to MetaCart
restrictive assumptions can perform even better. In this paper we evaluate approaches for inducing classifiers from data, based on the theory of learning Bayesian networks. These networks are factored representations of probability distributions that generalize the naive Bayesian classifier and explicitly

The English Noun Phrase in its Sentential Aspect

by Steven Paul Abney - PH.D. DISSERTATION MIT , 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "non-lexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract - Cited by 532 (4 self) - Add to MetaCart
assumptions now standard within the Government-Binding (GB) framework. The central empirical problem addressed is the question of the proper analysis of the so-called "Poss-ing" gerund in English. This construction possesses simultaneously many properties of sentences, and many properties of noun

Dynamic programming algorithm optimization for spoken word recognition

by Hiroaki Sakoe, Seibi Chiba - IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING , 1978
"... This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using timewarping function. Then, two time-normalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract - Cited by 788 (3 self) - Add to MetaCart
is restricted so as to improve discrimination between words in different categories. AND SEIBI CHIBA vestigations were made, based on the assumption that speech patterns are time-sampled with a common and uniform sampling period, as in most general cases. One of the problems discussed in this paper involves

An assumption-based truth-maintenance system

by Raymond Reiter, Johan De Kleer - Artificial Intelligence , 1986
"... In this paper we (1) define the concept of a Clause Man-agetnent System (CMS) — a generaizatiou of de Kleer’s ATMS, (2) motivate such systems in terms of efficiency of search and abductive reasoning, and (3) characterize the computation affected by a CMS in terms of the concept of prime implicants. ..."
Abstract - Cited by 334 (11 self) - Add to MetaCart
. For efficient search-~Sdefines a most general context in which C holds. A traditional ATMS/TMS is a restricted CMS in which (1) the clauses transmitted to the CMS are limited to be either Horn (i.e., justifications) or negative (i.e., nogoods),

Learning to Order Things

by William W. Cohen, Robert E. Schapire, Yoram Singer - Journal of Artificial Intelligence Research , 1998
"... There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of preference judgments, i.e., statements to the effect that one instance should be ranked ahead of another. We outline a ..."
Abstract - Cited by 409 (12 self) - Add to MetaCart
that the problem of finding the ordering that agrees best with a preference function is NP-complete, even under very restrictive assumptions. Nevertheless, we describe a simple greedy algorithm that is guaranteed to find a good approximation. We then discuss an on-line learning algorithm, based on the "
Next 10 →
Results 1 - 10 of 5,331
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University