The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nowadays, software development has been greatly influenced by question-answering communities, such as Stack Overflow. A new problem-solving paradigm has emerged, as developers post problems they encounter that are then answered by the community. In this paper, we propose a methodology that allows searching for solutions in Stack Overflow, using the main elements of a question post, including not only...
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three...
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approach relies on the construction of a new sparse vector designed to approximate the normalized inner-product between underlying signal vectors. The resulting ANN search algorithm shows significant improvement compared to querying...
This paper proposes a new method to automatically index searches for relevant images using geo-coded information. Photographic images are labeled with their GPS (Global Positioning System) coordinates and date/time at the moment of capture and this date is then utilized to create two layer spatial and temporal indexes for image searches. A simulation performed to estimate the effectiveness of the...
In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access, (1) without leaking information about the remaining documents, (2) without imposing large load on the receptionist, and (3) with a balanced load on the index servers. To address this problem, we...
We consider the problem of similarity search in metric spaces with costly distance functions and large databases. There is a trade-off between the amount of information stored in the index and the reduction in the number of comparisons for solving a query. Pivot-based methods clearly outperform clustering-based ones in number of comparisons, but their space requirements are higher and this can prevent...
The increasing usage of location-aware devices, such as GPS and RFID, has made moving object management an important task. Especially, being demanded in real-world applications, continuous query processing on moving objects has attracted significant research efforts. However, little attention has been given to the design of concurrent continuous query processing for multi-user environments. In this...
Searching for particular resources in a large-scale decentralized unstructured network can be very difficult since there is no centralized management to provide the specific location of resources. Moreover, the dynamic behavior of networks and the diversity of user behavior cause the search more complex and may not guarantee success. To address the problems, we propose a new adaptive resource indexing...
While spoken term detection (STD) systems based on word indices provide good accuracy, there are several practical applications where it is infeasible or too costly to employ an LVCSR engine. An STD system is presented, which is designed to incorporate a fast phonetic decoding front-end and be robust to decoding errors whilst still allowing for rapid search speeds. This goal is achieved through monophone...
Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (all the terms in the query need to be in the document, but not vice versa). For sponsored search, ads are associated with bids. When a user issues a search query, bids are typically matched to the query using broad-match semantics:...
This paper discusses important scalability issues exhibited by the high-dimensional, automatic audio recognition problem. The emphasis is especially put on a well-known, robust fingerprint algorithm. Extensive tests on a very large database show the importance of the parametrization of the algorithm, in order to afford an efficient search strategy. We also quantitatively verify the capital attention...
Users cannot search information by mathematical formulas as queries in existing search engines. This is because mathematical formulas are not expressed as a sequence of characters. Some formulas are expressed in a complex structure like fractional numbers and index numbers. We present a search engine for MathML objects using the structure of mathematical formulas. The system makes the inverted indices...
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Similarity queries are commonly used in data cleaning for matching similar data. In this work we concentrate on the following problem of approximate string matching based on edit distance: from a collection of strings, how to find those strings...
In comparison to traditional graph search, containment search has its own indexing characteristics that have not yet been examined. We propose a scalable contrast subgraph-based indexing model, called csgIndex. Using a redundancy-aware feature selection process, csgIndex can sort out a set of significant and distinctive contrast subgraphs and maximize its indexing capability. Taking this solution...
Database applications dealing with spatial objects that continuously change their position over time is gaining an increased interest. The goal is to store and query the positions of these objects. Index structures were proposed to achieve this goal. While index structures are designed mainly for unconstrained movement, databases in transportation networks are characterized by not only the speed to...
Searching for objects is a fundamental problem for popular peer-to-peer file-sharing networks that contribute to much of the traffic on today's Internet. While existing protocols can effectively locate highly popular files, studies show that they fail to locate a significant portion of existing files in the network. High recall for these "rare" objects would drastically improve the user...
In geographic information system (GIS), fast and efficiently indexing moving objects are a crucial issue in several application domains, such as LBS, intelligence transportation and digital battle. In this paper, a new index structure, PQR-tree, is proposed to fast update and efficiently index the present or near future positions of constrained moving objects based on the characters of moving objects...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.