Sciweavers

199 search results - page 6 / 40
» Intensional Positive Set Theory
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 6 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
JLP
2006
108views more  JLP 2006»
13 years 7 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
WWW
2010
ACM
14 years 2 months ago
Predicting positive and negative links in online social networks
We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or ant...
Jure Leskovec, Daniel P. Huttenlocher, Jon M. Klei...
ADCM
2010
129views more  ADCM 2010»
13 years 7 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser