Sciweavers

5316 search results - page 892 / 1064
» Which Search Problems Are Random
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 2 months ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...
CGO
2011
IEEE
14 years 8 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
PVLDB
2011
14 years 7 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
WSDM
2012
ACM
309views Data Mining» more  WSDM 2012»
13 years 12 months ago
Mining contrastive opinions on political texts using cross-perspective topic model
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...
Yi Fang, Luo Si, Naveen Somasundaram, Zhengtao Yu
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 5 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...