Sciweavers

114 search results - page 9 / 23
» Local and Global Approximations for Incomplete Data
Sort
View
87
Voted
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 10 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...
99
Voted
BTW
2001
Springer
113views Database» more  BTW 2001»
15 years 4 months ago
Version Propagation in Federated Database Systems
Abstract Integrated engineering environments, based on federated database technology, are, among others, a means to control the integrity of and dependencies between product data c...
Martin Schönhoff, Markus Strässler, Klau...
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 6 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
WWW
2003
ACM
16 years 9 days ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
INFOCOM
2009
IEEE
15 years 6 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston