• 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 82,503
Next 10 →

Data Cleaning: Problems and Current Approaches

by Erhard Rahm, Hong Hai Do - IEEE Data Engineering Bulletin , 2000
"... We classify data quality problems that are addressed by data cleaning and provide an overview of the main solution approaches. Data cleaning is especially required when integrating heterogeneous data sources and should be addressed together with schema-related data transformations. In data warehouse ..."
Abstract - Cited by 279 (8 self) - Add to MetaCart
We classify data quality problems that are addressed by data cleaning and provide an overview of the main solution approaches. Data cleaning is especially required when integrating heterogeneous data sources and should be addressed together with schema-related data transformations. In data

Current approaches to change blindness

by Daniel J. Simons - Visual Cognition: Special Issue on Change Detection and Visual Memory
"... Across saccades, blinks, blank screens, movie cuts, and other interruptions, ob-servers fail to detect substantial changes to the visual details of objects and scenes. This inability to spot changes (“change blindness”) is the focus of this special issue of Visual Cognition. This introductory paper ..."
Abstract - Cited by 146 (10 self) - Add to MetaCart
Across saccades, blinks, blank screens, movie cuts, and other interruptions, ob-servers fail to detect substantial changes to the visual details of objects and scenes. This inability to spot changes (“change blindness”) is the focus of this special issue of Visual Cognition. This introductory paper briefly reviews recent studies of change blindness, noting the relation of these findings to earlier re-search and discussing the inferences we can draw from them. Most explanations of change blindness assume that we fail to detect changes because the changed display masks or overwrites the initial display. Here I draw a distinction between intentional and incidental change detection tasks and consider how alternatives to the “overwriting ” explanation may provide better explanations for change blindness. Imagine you are watching a movie in which an actor is sitting in a cafeteria with a jacket slung over his shoulder. The camera then cuts to a close-up and his jacket is now over the back of his chair. You might think that everyone would notice this obvious editing mistake. Yet, recent research on visual memory has found that people are surprisingly poor at noticing large changes to objects, photographs, and motion pictures from one instant to the next (see Simons & Levin, 1997 for a review). Although researchers have long noted the existence

A Survey of Approaches to Automatic Schema Matching

by Erhard Rahm, Philip A. Bernstein - VLDB JOURNAL , 2001
"... Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous ..."
Abstract - Cited by 1351 (51 self) - Add to MetaCart
Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous

On optimistic methods for concurrency control

by H. T. Kung, John T. Robinson - ACM Transactions on Database Systems , 1981
"... Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a co ..."
Abstract - Cited by 546 (1 self) - Add to MetaCart
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a

TnT - A Statistical Part-Of-Speech Tagger

by Thorsten Brants , 2000
"... Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger. Contrary to claims found elsewhere in the literature, we argue that a tagger based on Markov models performs at least as well as other current approaches, including the Maximum Entropy framework. A recent comparison h ..."
Abstract - Cited by 540 (5 self) - Add to MetaCart
Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger. Contrary to claims found elsewhere in the literature, we argue that a tagger based on Markov models performs at least as well as other current approaches, including the Maximum Entropy framework. A recent comparison

Quicktime VR - an image-based approach to virtual environment navigation.

by Shenchang Eric Chen - In SIGGRAPH 95 Conference Proceedings, , 1995
"... ABSTRACT Traditionally, virtual reality systems use 3D computer graphics to model and render virtual environments in real-time. This approach usually requires laborious modeling and expensive special purpose rendering hardware. The rendering quality and scene complexity are often limited because of ..."
Abstract - Cited by 527 (0 self) - Add to MetaCart
, specialized panoramic cameras or by "stitching" together overlapping photographs taken with a regular camera. Walking in a space is currently accomplished by "hopping" to different panoramic points. The image-based approach has been used in the commercial product QuickTime VR, a virtual

Case-based reasoning; Foundational issues, methodological variations, and system approaches

by Agnar Aamodt, Enric Plaza - AI COMMUNICATIONS , 1994
"... Case-based reasoning is a recent approach to problem solving and learning that has got a lot of attention over the last few years. Originating in the US, the basic idea and underlying theories have spread to other continents, and we are now within a period of highly active research in case-based rea ..."
Abstract - Cited by 855 (25 self) - Add to MetaCart
-based reasoning in Europe, as well. This paper gives an overview of the foundational issues related to case- based reasoning, describes some of the leading methodo- logical approaches within the field, and exemplifies the current state through pointers to some systems. Initially, a general framework is defined

Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories

by Li Fei-fei , 2004
"... Abstract — Current computational approaches to learning visual object categories require thousands of training images, are slow, cannot learn in an incremental manner and cannot incorporate prior information into the learning process. In addition, no algorithm presented in the literature has been te ..."
Abstract - Cited by 784 (16 self) - Add to MetaCart
Abstract — Current computational approaches to learning visual object categories require thousands of training images, are slow, cannot learn in an incremental manner and cannot incorporate prior information into the learning process. In addition, no algorithm presented in the literature has been

The pyramid match kernel: Discriminative classification with sets of image features

by Kristen Grauman, Trevor Darrell - IN ICCV , 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract - Cited by 544 (29 self) - Add to MetaCart
for use in learning algorithms whose optimal solutions are guaranteed only for Mercer kernels. We demonstrate our algorithm on object recognition tasks and show it to be accurate and dramatically faster than current approaches.

• Current Approach

by Oscar P. Bruno, Matthew M. Pohlman
"... – Piecewise interpolation methods are fast, but only C n for "small " n, n ∈ {0, 1} for surfaces – Efficient trigonometric interpolation methods (using the FFT) are C ∞ but require evenly spaced data ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
– Piecewise interpolation methods are fast, but only C n for "small " n, n ∈ {0, 1} for surfaces – Efficient trigonometric interpolation methods (using the FFT) are C ∞ but require evenly spaced data
Next 10 →
Results 1 - 10 of 82,503
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