Sciweavers

145 search results - page 21 / 29
» Discovery-driven graph summarization
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 3 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ESOP
2010
Springer
14 years 1 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers
BXML
2004
13 years 11 months ago
Trust and context using the RDF-Source related Storage System (RDF-S3) and easy RQL (eRQL)
Abstract. There exist different ways how to understand and use context information for RDF data. This paper summarizes these different ways and concentrates on the source informati...
Karsten Tolle, Fabian Wleklinski
SIAMDM
2008
99views more  SIAMDM 2008»
13 years 9 months ago
Hat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
Steve Butler, Mohammad Taghi Hajiaghayi, Robert D....
NETWORK
2007
167views more  NETWORK 2007»
13 years 9 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao