Sciweavers

1519 search results - page 41 / 304
» A Search Log-Based Approach to Evaluation
Sort
View
EDBT
2008
ACM
132views Database» more  EDBT 2008»
15 years 12 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 7 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
AAAI
2000
15 years 1 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
EMNLP
2009
14 years 9 months ago
Unsupervised morphological segmentation and clustering with document boundaries
Many approaches to unsupervised morphology acquisition incorporate the frequency of character sequences with respect to each other to identify word stems and affixes. This typical...
Taesun Moon, Katrin Erk, Jason Baldridge
CIKM
2011
Springer
13 years 11 months ago
Block-based load balancing for entity resolution with MapReduce
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the...
Lars Kolb, Andreas Thor, Erhard Rahm