Sciweavers

335 search results - page 59 / 67
» How to Use Spanning Trees to Navigate in Graphs
Sort
View
HPDC
2010
IEEE
15 years 7 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 11 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
PDIS
1996
IEEE
15 years 10 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
CGF
1998
104views more  CGF 1998»
15 years 5 months ago
Animation of Biological Organ Growth Based on L-systems
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter