<--- Back to Details
First PageDocument Content
Graph / Tree / Shortest path problem / Tuple / Loop-erased random walk / Object-based spatial database / Graph theory / Mathematics / Theoretical computer science
Date: 2006-07-29 01:50:33
Graph
Tree
Shortest path problem
Tuple
Loop-erased random walk
Object-based spatial database
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 1,45 MB

Share Document on Facebook

Similar Documents

PRIMITIVE VECTORS AND SLn KEITH CONRAD An n-tuple [a1 , . . . , an ] ∈ Zn is called primitive when its coordinates are relatively prime as an n-tuple. For instance, [6, 10, 15] is a primitive vector in Z3 : even though

DocID: 1vpJ4 - View Document

January 24, 2003 A NON-COMMUTATIVE POSITIVSTELLENSATZ ON ISOMETRIES JOHN W. HELTON, SCOTT MC CULLOUGH, MIHAI PUTINAR Abstract. A symmetric non-commutative polynomial p when evaluated at a tuple of operators on a finite d

DocID: 1vfax - View Document

The N-Tuple Bandit Evolutionary Algorithm for Automatic Game Improvement Kamolwan Kunanusont, Raluca D. Gaina, Jialin Liu, Diego Perez-Liebana and Simon M. Lucas University of Essex, Colchester, UK Email: {kkunan, rdgain

DocID: 1v85W - View Document

Data management / Database theory / Computing / Data / Data stream management system / Relational database / Join / Tuple / Chase / Database

Dhananjay Kulkarni (Boston University) Chinya V. Ravishankar (University of California – Riverside) SSDBM 2008 Printed with FinePrint trial version - purchase at www.fineprint.com

DocID: 1rtgU - View Document

Anonymity / Privacy / Mathematics / K-anonymity / Structure / L-diversity / Tuple / Finitary relation

Non-homogeneous Generalization in Privacy Preserving Data Publishing ∗ W. K. Wong, Nikos Mamoulis and David W. Cheung Department of Computer Science, The University of Hong Kong

DocID: 1rscI - View Document