3105 search results - page 411 / 621 » The Path-Packing Structure of Graphs |
142
click to vote
JUCS
2006
15 years 4 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
139
Voted
DCG
2002
15 years 4 months ago
2002
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
159
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
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...
144
click to vote
INTERNET
2010
15 years 2 months ago
2010
 We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of MashQL is that it does not requireÂ...
168
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...