Sciweavers

73 search results - page 5 / 15
» An Optimal Algorithm for Querying Tree Structures and its Ap...
Sort
View
124
Voted
ALT
2008
Springer
16 years 11 days ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin
167
Voted
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 5 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
FUIN
2010
143views more  FUIN 2010»
15 years 23 days ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
171
Voted
PPOPP
2011
ACM
14 years 6 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 10 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....