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

CiteSeerX logo

Tools

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

Planarizing Gadgets for Perfect Matching do not Exist1

by Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf , 2011
"... To compare the complexity of the perfect matching problem for general graphs with that for planar graphs, one might try to come up with a reduction from the perfect matching problem to the planar perfect matching problem. The obvious way to construct such a reduc-tion is via a planarizing gadget, a ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
To compare the complexity of the perfect matching problem for general graphs with that for planar graphs, one might try to come up with a reduction from the perfect matching problem to the planar perfect matching problem. The obvious way to construct such a reduc-tion is via a planarizing gadget, a

Generic Schema Matching with Cupid

by Jayant Madhavan, Philip Bernstein, Erhard Rahm - In The VLDB Journal , 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract - Cited by 593 (17 self) - Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past

Iterative point matching for registration of free-form curves and surfaces

by Zhengyou Zhang , 1994
"... A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense 3-D maps obtained by using a correlation-based stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract - Cited by 659 (7 self) - Add to MetaCart
in one set to the closest points in the other. A statistical method based on the distance distribution is used to deal with outliers, occlusion, appearance and disappearance, which allows us to do subset-subset matching. A least-squares technique is used to estimate 3-D motion from the point

SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries

by James Z. Wang, Jia Li, Gio Wiederhold - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... The need for efficient content-based image retrieval has increased tremendously in many application areas such as biomedicine, military, commerce, education, and Web image classification and searching. We present here SIMPLIcity (Semanticssensitive Integrated Matching for Picture LIbraries), an imag ..."
Abstract - Cited by 541 (35 self) - Add to MetaCart
The need for efficient content-based image retrieval has increased tremendously in many application areas such as biomedicine, military, commerce, education, and Web image classification and searching. We present here SIMPLIcity (Semanticssensitive Integrated Matching for Picture LIbraries

A Guided Tour to Approximate String Matching

by Gonzalo Navarro - ACM COMPUTING SURVEYS , 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract - Cited by 584 (38 self) - Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining

Empirical exchange rate models of the Seventies: do they fit out of sample?

by Richard A. Meese, Kenneth Rogoff - JOURNAL OF INTERNATIONAL ECONOMICS , 1983
"... This study compares the out-of-sample forecasting accuracy of various structural and time series exchange rate models. We find that a random walk model performs as well as any estimated model at one to twelve month horizons for the dollar/pound, dollar/mark, dollar/yen and trade-weighted dollar exch ..."
Abstract - Cited by 831 (12 self) - Add to MetaCart
This study compares the out-of-sample forecasting accuracy of various structural and time series exchange rate models. We find that a random walk model performs as well as any estimated model at one to twelve month horizons for the dollar/pound, dollar/mark, dollar/yen and trade-weighted dollar exchange rates. The candidate structural models include the flexible-price (Frenkel-Bilson) and sticky-price (Dornbusch-Frankel) monetary models, and a sticky-price model which incorporates the current account (Hooper-Morton). The structural models perform poorly despite the fact that we base their forecasts on actual realized values of future explanatory variables.

What Do We Know about Capital Structure? Some Evidence from International Data

by Raghuram G. Rajan, Luigi Zingales, James Seward - Journal of Finance , 1995
"... We investigate the determinants of capital structure choice by analyzing the financing decisions of public firms in the major industrialized countries. At an aggregate level, firm leverage is fairly similar across the G-7 countries. We find that factors identified by previous studies as correlated i ..."
Abstract - Cited by 954 (14 self) - Add to MetaCart
We investigate the determinants of capital structure choice by analyzing the financing decisions of public firms in the major industrialized countries. At an aggregate level, firm leverage is fairly similar across the G-7 countries. We find that factors identified by previous studies as correlated in the cross-section with firm leverage in the U.S., are similarly correlated in other countries as well. However, a deeper examination of the U.S. and foreign evidence suggests that the theoretical underpinnings of the observed correlations are still largely unresolved.

Histograms of Oriented Gradients for Human Detection

by Navneet Dalal, Bill Triggs - In CVPR , 2005
"... We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient based descriptors, we show experimentally that grids of Histograms of Oriented Gradient (HOG) descriptors significantly out ..."
Abstract - Cited by 3678 (9 self) - Add to MetaCart
We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient based descriptors, we show experimentally that grids of Histograms of Oriented Gradient (HOG) descriptors significantly

Using spin images for efficient object recognition in cluttered 3D scenes

by Andrew E. Johnson, Martial Hebert - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1999
"... We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor that i ..."
Abstract - Cited by 571 (9 self) - Add to MetaCart
We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor

Flexible camera calibration by viewing a plane from unknown orientations

by Zhengyou Zhang , 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract - Cited by 512 (7 self) - Add to MetaCart
We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion
Next 10 →
Results 1 - 10 of 510,621
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-2018 The Pennsylvania State University