Sciweavers

796 search results - page 49 / 160
» The Anonymous Subgraph Problem
Sort
View
SPC
2005
Springer
15 years 8 months ago
On the Anonymity of Periodic Location Samples
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
Marco Gruteser, Baik Hoh
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 2 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
PVLDB
2010
129views more  PVLDB 2010»
15 years 25 days ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
IROS
2009
IEEE
149views Robotics» more  IROS 2009»
15 years 9 months ago
Mutual localization in a multi-robot system with anonymous relative position measures
— We address the mutual localization problem for a multi-robot system, under the assumption that each robot is equipped with a sensor that provides a measure of the relative posi...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
STACS
2005
Springer
15 years 8 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...