• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7433
  • 1103
  • 1048
  • 794
  • 476
  • 291
  • 237
  • 184
  • 90
  • 81
  • 63
  • 52
  • 44
  • 43
  • 42
  • Tagged with
  • 14405
  • 9224
  • 3942
  • 2366
  • 1924
  • 1915
  • 1721
  • 1624
  • 1513
  • 1439
  • 1372
  • 1354
  • 1341
  • 1275
  • 1269
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
271

An instruction fetch and translation unit for the G-processor of the G-machine /

Kuo, Shyue Ling, January 1988 (has links)
Thesis (M.S.)--Oregon Graduate Center, 1988.
272

Learning in spectral clustering /

Shortreed, Susan, January 2006 (has links)
Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (p. 167-170).
273

State minimization problems in finite state automata

Tauras, Chris. January 1900 (has links)
Thesis (M.S.)--West Virginia University, 2007. / Title from document title page. Document formatted into pages; contains ii, 23 p. : ill. Includes abstract. Includes bibliographical references (p. 22-23).
274

Anomaly Detection Through Statistics-Based Machine Learning For Computer Networks

Zhu, Xuejun. January 2006 (has links) (PDF)
Dissertation (PhD)--University of Arizona, Tucson, Arizona, 2006.
275

Asymptotics of Gaussian Regularized Least-Squares

Lippert, Ross, Rifkin, Ryan 20 October 2005 (has links)
We consider regularized least-squares (RLS) with a Gaussian kernel. Weprove that if we let the Gaussian bandwidth $\sigma \rightarrow\infty$ while letting the regularization parameter $\lambda\rightarrow 0$, the RLS solution tends to a polynomial whose order iscontrolled by the relative rates of decay of $\frac{1}{\sigma^2}$ and$\lambda$: if $\lambda = \sigma^{-(2k+1)}$, then, as $\sigma \rightarrow\infty$, the RLS solution tends to the $k$th order polynomial withminimal empirical error. We illustrate the result with an example.
276

Blog fingerprinting identifying anonymous posts written by an author of interest using word and character frequency analysis /

Dreier, David J. January 2009 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2009. / Thesis Advisor(s): Martell, Craig H. "September 2009." Description based on title screen as viewed on November 9, 2009. Author(s) subject terms: Author Attribution, Authorship Attribution, Authorship Verification, Natural Language Processing, Machine Learning, Blogs, Bayes, Bayesian, Support Vector Machine, Internet Communication. Includes bibliographical references (p. 71-74). Also available in print.
277

Contribution à la modélisation du système oculo-moteur de vergence de l'opérateur humain.

Arafi, Hadi, January 1900 (has links)
Th. doc.-ing.--Lille 1, 1977. N°: 213.
278

Étude en régime permanent d'une machine asynchrone alimentée par un onduleur à transistors : performances, pertes, échauffements.

Bahbouth, Simon, January 1900 (has links)
Th. doct.-ing.--Électrotech.--Grenoble--I.N.P., 1981. N°: DI 225.
279

Multi-cue visual tracking: feature learning and fusion

Lan, Xiangyuan 10 August 2016 (has links)
As an important and active research topic in computer vision community, visual tracking is a key component in many applications ranging from video surveillance and robotics to human computer. In this thesis, we propose new appearance models based on multiple visual cues and address several research issues in feature learning and fusion for visual tracking. Feature extraction and feature fusion are two key modules to construct the appearance model for the tracked target with multiple visual cues. Feature extraction aims to extract informative features for visual representation of the tracked target, and many kinds of hand-crafted feature descriptors which capture different types of visual information have been developed. However, since large appearance variations, e.g. occlusion, illumination may occur during tracking, the target samples may be contaminated/corrupted. As such, the extracted raw features may not be able to capture the intrinsic properties of the target appearance. Besides, without explicitly imposing the discriminability, the extracted features may potentially suffer background distraction problem. To extract uncontaminated discriminative features from multiple visual cues, this thesis proposes a novel robust joint discriminative feature learning framework which is capable of 1) simultaneously and optimally removing corrupted features and learning reliable classifiers, and 2) exploiting the consistent and feature-specific discriminative information of multiple feature. In this way, the features and classifiers learned from potentially corrupted tracking samples can be better utilized for target representation and foreground/background discrimination. As shown by the Data Processing Inequality, information fusion in feature level contains more information than that in classifier level. In addition, not all visual cues/features are reliable, and thereby combining all the features may not achieve a better tracking performance. As such, it is more reasonable to dynamically select and fuse multiple visual cues for visual tracking. Based on aforementioned considerations, this thesis proposes a novel joint sparse representation model in which feature selection, fusion, and representation are performed optimally in a unified framework. By taking advantages of sparse representation, unreliable features are detected and removed while reliable features are fused on feature level for target representation. In order to capture the non-linear similarity of features, the model is further extended to perform feature fusion in kernel space. Experimental results demonstrate the effectiveness of the proposed model. Since different visual cues extracted from the same object should share some commonalities in their representations and each feature should also have some diversities to reflect its complementarity in appearance modeling, another important problem in feature fusion is how to learn the commonality and diversity in the fused representations of multiple visual cues to enhance the tracking accuracy. Different from existing multi-cue sparse trackers which only consider the commonalities among the sparsity patterns of multiple visual cues, this thesis proposes a novel multiple sparse representation model for multi-cue visual tracking which jointly exploits the underlying commonalities and diversities of different visual cues by decomposing multiple sparsity patterns. Moreover, this thesis introduces a novel online multiple metric learning to efficiently and adaptively incorporate the appearance proximity constraint, which ensures that the learned commonalities of multiple visual cues are more representative. Experimental results on tracking benchmark videos and other challenging videos show that the proposed tracker achieves better performance than the existing sparsity-based trackers and other state-of-the-art trackers.
280

Theory and applications of a bottom-up syntax-directed translator

Abramson, Harvey David January 1970 (has links)
No description available.

Page generated in 0.0443 seconds