• 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 1,997,755
Next 10 →

Improved methods for building protein models in electron density maps and the location of errors in these models. Acta Crystallogr. sect

by T. A. Jones, J. -y. Zou, S. W. Cowan, M. Kjeldgaard - A , 1991
"... Map interpretation remains a critical step in solving the structure of a macromolecule. Errors introduced at this early stage may persist throughout crystallo-graphic refinement and result in an incorrect struc-ture. The normally quoted crystallographic residual is often a poor description for the q ..."
Abstract - Cited by 1016 (9 self) - Add to MetaCart
for the quality of the model. Strategies and tools are described that help to alleviate this problem. These simplify the model-building process, quantify the goodness of fit of the model on a per-residue basis and locate possible errors in pep-tide and side-chain conformations.

A Volumetric Method for Building Complex Models from Range Images

by Brian Curless, Marc Levoy , 1996
"... A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, and robus ..."
Abstract - Cited by 1018 (18 self) - Add to MetaCart
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, and robustness in the presence of outliers. Prior algorithms possess subsets of these properties. In this paper, we present a volumetric method for integrating range images that possesses all of these properties. Our volumetric representation consists of a cumulative weighted signed distance function. Working with one range image at a time, we first scan-convert it to a distance function, then combine this with the data already acquired using a simple additive scheme. To achieve space efficiency, we employ a run-length encoding of the volume. To achieve time efficiency, we resample the range image to align with the voxel grid and traverse the range and voxel scanlines synchronously. We generate the f...

Computer support for knowledge-building communities

by Marlene Scardamalia, Carl Bereiter - The Journal of the Learning Sciences , 1994
"... Nobody wants to use technology to recreate education as it is, yet there is not much to distinguish what goes on in most computer-supported classrooms versus traditional classrooms. Kay (1991) has suggested that the phenomenon of reframing innovations to recreate the familiar is itself commonplace. ..."
Abstract - Cited by 593 (4 self) - Add to MetaCart
, knowledge content has been processed by the students. In this chapter we offer a suggestion for how to escape the pattern of reinventing the familiar with educational technology. Knowledge-building discourse is at the heart of the superior education that we have in mind. We argue that the classroom needs

Building Natural Language Generation Systems

by Ehud Reiter , 2000
"... ..."
Abstract - Cited by 491 (44 self) - Add to MetaCart
Abstract not found

The SWISS-MODEL Workspace: A web-based environment for protein structure homology modelling

by Konstantin Arnold, Lorenza Bordoli, Torsten Schwede, et al. - BIOINFORMATICS , 2005
"... Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental three-dimensional structures are available. Building homology models requires specialized programs and up-to-date sequence and structural databases. Integrating all re ..."
Abstract - Cited by 555 (5 self) - Add to MetaCart
Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental three-dimensional structures are available. Building homology models requires specialized programs and up-to-date sequence and structural databases. Integrating all

RADAR: an in-building RF-based user location and tracking system

by Paramvir Bahl, Venkata N. Padmanabhan , 2000
"... The proliferation of mobile computing devices and local-area wireless networks has fostered a growing interest in location-aware systems and services. In this paper we present RADAR, a radio-frequency (RF) based system for locating and tracking users inside buildings. RADAR operates by recording and ..."
Abstract - Cited by 2002 (14 self) - Add to MetaCart
The proliferation of mobile computing devices and local-area wireless networks has fostered a growing interest in location-aware systems and services. In this paper we present RADAR, a radio-frequency (RF) based system for locating and tracking users inside buildings. RADAR operates by recording

Building a Large Annotated Corpus of English: The Penn Treebank

by Mitchell P. Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz - COMPUTATIONAL LINGUISTICS , 1993
"... There is a growing consensus that significant, rapid progress can be made in both text understanding and spoken language understanding by investigating those phenomena that occur most centrally in naturally occurring unconstrained materials and by attempting to automatically extract information abou ..."
Abstract - Cited by 2690 (11 self) - Add to MetaCart
for enterprises as diverse as the automatic construction of statistical models for the grammar of the written and the colloquial spoken language, the development of explicit formal theories of the differing grammars of writing and speech, the investigation of prosodic phenomena in speech, and the evaluation

Pin: building customized program analysis tools with dynamic instrumentation

by Chi-keung Luk, Robert Cohn, Robert Muth, Harish Patil, Artur Klauser, Geoff Lowney, Steven Wallace, Vijay Janapa, Reddi Kim Hazelwood - In PLDI ’05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation , 2005
"... Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we have developed a new instrumentation system called Pin. Our goals are to provide easy-to-use, portable, transparent, and eff ..."
Abstract - Cited by 957 (34 self) - Add to MetaCart
, and efficient instrumentation. Instrumentation tools (called Pintools) are written in C/C++ using Pin’s rich API. Pin follows the model of ATOM, allowing the tool writer to analyze an application at the instruction level without the need for detailed knowledge of the underlying instruction set. The API

Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks

by Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly - In EuroSys , 2007
"... Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad applica-tion combines computational “vertices ” with communica-tion “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract - Cited by 730 (27 self) - Add to MetaCart
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad applica-tion combines computational “vertices ” with communica-tion “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of available computers, communicating as appropriate through files, TCP pipes, and shared-memory FIFOs. The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run simultaneously on multi-ple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation pro-gresses to make efficient use of the available resources. Dryad is designed to scale from powerful multi-core sin-gle computers, through small clusters of computers, to data centers with thousands of computers. The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between ver-tices.

Model Theory

by Wilfrid Hodges , 2000
"... ..."
Abstract - Cited by 748 (4 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 1,997,755
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