Sciweavers

2501 search results - page 57 / 501
» Logics with Rank Operators
Sort
View
128
Voted
DAWAK
2004
Springer
15 years 6 months ago
Inductive Databases as Ranking
Abstract. Most of the research in data mining has been focused on developing novel algorithms for specific data mining tasks. However, finding the theoretical foundations of data...
Taneli Mielikäinen
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
15 years 17 days ago
NAGA: harvesting, searching and ranking knowledge
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
CIKM
2010
Springer
14 years 10 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
93
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 21 days ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
137
Voted
ORL
2011
14 years 3 months ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta