Sciweavers

2498 search results - page 250 / 500
» Data Structures with Unpredictable Timing
Sort
View
136
Voted
JASIS
2007
121views more  JASIS 2007»
15 years 2 months ago
Can citation analysis of Web publications better detect research fronts?
We present evidence that, in some research fields, research published in journals and reported on the Web may collectively represent different evolutionary stages of the field wit...
Dangzhi Zhao, Andreas Strotmann
127
Voted
CP
2007
Springer
15 years 6 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 2 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
109
Voted
WWW
2010
ACM
15 years 9 months ago
Scalable discovery of contradictions on the web
Our study addresses the problem of large-scale contradiction detection and management, from data extracted from the Web. We describe the first systematic solution to the problem,...
Mikalai Tsytsarau, Themis Palpanas, Kerstin Deneck...
109
Voted
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
15 years 8 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...