Sciweavers

773 search results - page 9 / 155
» Traversing the Machining Graph
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 9 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
ICTAI
2007
IEEE
14 years 4 months ago
Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
Keven Ates, Kang Zhang
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 2 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 11 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
13 years 11 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...