Sciweavers

4972 search results - page 692 / 995
» Ranking on graph data
Sort
View
TKDE
2008
121views more  TKDE 2008»
15 years 6 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
FUIN
2000
109views more  FUIN 2000»
15 years 6 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman
COMGEO
1999
ACM
15 years 6 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
VLDB
2002
ACM
116views Database» more  VLDB 2002»
15 years 6 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
211
Voted
PR
2008
170views more  PR 2008»
15 years 6 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...