• 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 11 - 20 of 14,399
Next 10 →

Fixing the Java memory model

by Jeremy Manson, William Pugh, Sarita V. Adve, Jeremy Manson - In ACM Java Grande Conference , 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract - Cited by 385 (10 self) - Add to MetaCart
This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines

A hidden Markov model for predicting transmembrane helices in protein sequences

by Erik L. L. Sonnhammer - In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB , 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane- spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract - Cited by 373 (9 self) - Add to MetaCart
A novel method to model and predict the location and orientation of alpha helices in membrane- spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core

Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm

by Irina F. Gorodnitsky, Bhaskar D. Rao - IEEE TRANS. SIGNAL PROCESSING , 1997
"... We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algor ..."
Abstract - Cited by 368 (22 self) - Add to MetaCart
), the algorithm has two integral parts: a low-resolution initial estimate of the real signal and the iteration process that refines the initial estimate to the final localized energy solution. The iterations are based on weighted norm minimization of the dependent variable with the weights being a function

A unified architecture for natural language processing: Deep neural networks with multitask learning

by Ronan Collobert, Jason Weston , 2008
"... We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and sem ..."
Abstract - Cited by 340 (13 self) - Add to MetaCart
We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically

Three New Probabilistic Models for Dependency Parsing: An Exploration

by Jason M. Eisner , 1996
"... After presenting a novel O(n³) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model where words fluctuate randomly in their selectional prefe ..."
Abstract - Cited by 318 (14 self) - Add to MetaCart
After presenting a novel O(n³) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model where words fluctuate randomly in their selectional

Design Verification and Optimization of Novel Parts Feeders with the Impulse Dynamic Simulator

by Dan Reznik, John Canny
"... The Impulse dynamic simulator is used to generate a wide range of synthetic measurements for both a MEMs- and a longitudinally-vibrating parts feeders. Impulse allows the devices ' mechanics to be modeled in detail and for results to be generated both accurately and efficiently. Obtaining such ..."
Abstract - Add to MetaCart
the design for higher feed rates; and (iv) generate simple dynamic models of their behavior. I. Introduction The Impulse dynamic simulator [1] is used to generate a wide range of synthetic measurements for two novel parts feeder designs. The first design is a MEMs-based actuator array called the M-Chip [2

Activation of the middle fusiform ‘face area’ increases with expertise in recognizing novel objects,

by Isabel Gauthier , Michael J Tarr , Adam W Anderson , Pawel Skudlarski , John C Gore - Nature Neuroscience , 1999
"... 568 nature neuroscience • volume 2 no 6 • june 1999 articles Evidence for specialization in the fusiform gyrus for human face perception comes from both neuroimaging and neuropsychological studies Subjects were trained with novel objects called greebles 14 RESULTS We localized the brain areas mor ..."
Abstract - Cited by 264 (20 self) - Add to MetaCart
568 nature neuroscience • volume 2 no 6 • june 1999 articles Evidence for specialization in the fusiform gyrus for human face perception comes from both neuroimaging and neuropsychological studies Subjects were trained with novel objects called greebles 14 RESULTS We localized the brain areas

A finite-volume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.

by John Marshall , Alistair Adcroft , Chris Hill , Lev Perelman , Curt Heisey - J. Geophys. Res., , 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract - Cited by 293 (32 self) - Add to MetaCart
. The method makes possible a novel treatment of the boundary in which cells abutting the bottom or coast may take on irregular shapes and be "shaved" to fit the boundary. The algorithm can conveniently exploit massively parallel computers and suggests a domain decomposition which allocates vertical

Pedestrian detection in crowded scenes

by Bastian Leibe, Edgar Seemann, Bernt Schiele - In CVPR , 2005
"... In this paper, we address the problem of detecting pedestri-ans in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any type of model or feature alone. Instead, we present a novel al-gorithm that integrates evidence in multiple iterations an ..."
Abstract - Cited by 270 (27 self) - Add to MetaCart
In this paper, we address the problem of detecting pedestri-ans in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any type of model or feature alone. Instead, we present a novel al-gorithm that integrates evidence in multiple iterations

Learning Spatially Localized, Parts-Based Representation

by Stan Z. Li, Xinwen Hou, Hongjiang Zhang, QianSheng Cheng , 2001
"... In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual patterns. An objective function is defined to impose localization constraint, in addition to the non-negativity constraint i ..."
Abstract - Cited by 200 (7 self) - Add to MetaCart
In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual patterns. An objective function is defined to impose localization constraint, in addition to the non-negativity constraint
Next 10 →
Results 11 - 20 of 14,399
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