Sciweavers

1127 search results - page 120 / 226
» Testing the Expansion of a Graph
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 8 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
CMOT
2010
203views more  CMOT 2010»
14 years 7 months ago
A Bayesian approach to modeling lost person behaviors based on terrain features in Wilderness Search and Rescue
: In Wilderness Search and Rescue (WiSAR), the incident commander (IC) creates a probability distribution map of the likely location of the missing person. This map is important be...
Lanny Lin, Michael A. Goodrich
COLING
2010
14 years 5 months ago
Discriminative Training for Near-Synonym Substitution
Near-synonyms are useful knowledge resources for many natural language applications such as query expansion for information retrieval (IR) and paraphrasing for text generation. Ho...
Liang-Chih Yu, Hsiu-Min Shih, Yu-Ling Lai, Jui-Fen...
ICASSP
2011
IEEE
14 years 1 months ago
Basis pursuit for spectrum cartography
A nonparametric version of the basis pursuit method is developed for field estimation. The underlying model entails known bases, weighted by generic functions to be estimated fro...
Juan Andrés Bazerque, Gonzalo Mateos, Georg...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos