Sciweavers

1813 search results - page 264 / 363
» Instance Pruning Techniques
Sort
View
INFOCOM
2009
IEEE
16 years 1 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
ACML
2009
Springer
16 years 1 months ago
Conditional Density Estimation with Class Probability Estimators
Many regression schemes deliver a point estimate only, but often it is useful or even essential to quantify the uncertainty inherent in a prediction. If a conditional density estim...
Eibe Frank, Remco R. Bouckaert
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
16 years 29 days ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
WEBDB
2009
Springer
124views Database» more  WEBDB 2009»
16 years 29 days ago
Bridging the Terminology Gap in Web Archive Search
Web archives play an important role in preserving our cultural heritage for future generations. When searching them, a serious problem arises from the fact that terminology evolve...
Klaus Berberich, Srikanta J. Bedathur, Mauro Sozio...
ATAL
2009
Springer
16 years 29 days ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein