Sciweavers

3096 search results - page 387 / 620
» The Generalized FITC Approximation
Sort
View
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
15 years 4 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
SIAMDM
2010
149views more  SIAMDM 2010»
15 years 4 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...
TKDE
2010
148views more  TKDE 2010»
15 years 4 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
TOCHI
2010
90views more  TOCHI 2010»
15 years 4 months ago
Potential for personalization
Current Web search tools do a good job of retrieving documents that satisfy the wide range of intentions that people associate with a query – but do not do a very good job of di...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
WINET
2010
113views more  WINET 2010»
15 years 4 months ago
Designing multihop wireless backhaul networks with delay guarantees
— As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existi...
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang