Sciweavers

3267 search results - page 142 / 654
» Generalized quasirandom graphs
Sort
View
CIKM
2008
Springer
15 years 6 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
139
Voted
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 4 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 11 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
SIGMOD
1999
ACM
94views Database» more  SIGMOD 1999»
15 years 9 months ago
Logical Logging to Extend Recovery to New Domains
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...
David B. Lomet, Mark R. Tuttle