Sciweavers

1153 search results - page 12 / 231
» Reversing graph transformations
Sort
View
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 8 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
MLQ
1998
126views more  MLQ 1998»
13 years 7 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
JDM
2008
112views more  JDM 2008»
13 years 7 months ago
Reverse Engineering from an XML Document into an Extended DTD Graph
The extensible markup language (XML) has become a standard for persistent storage and data interchange via the Internet due to its openness, self-descriptiveness, and flexibility....
Herbert Shiu, Joseph Fong
ATAL
2006
Springer
13 years 11 months ago
Savings in Combinatorial Auctions Through Transformation Relationships
In a previous work we extended the notion of multi-unit combinatorial reverse auction (MUCRA) by adding a new dimension to the goods at auction. A buyer can express transformabilit...
Andrea Giovannucci, Jesús Cerquides, Juan A...
CONPAR
1992
13 years 11 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault