Sciweavers

1321 search results - page 152 / 265
» Quadratic forms on graphs
Sort
View
RSA
2010
118views more  RSA 2010»
13 years 8 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 11 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma
PPOPP
2012
ACM
12 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CVPR
2005
IEEE
15 years 5 days ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
ICIP
2006
IEEE
14 years 11 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis