Sciweavers

439 search results - page 49 / 88
» Unnesting Arbitrary Queries
Sort
View
UAI
2003
13 years 11 months ago
A Simple Insight into Iterative Belief Propagation's Success
In non-ergodic belief networks the posterior belief of many queries given evidence may become zero. The paper shows that when belief propagation is applied iteratively over arbitr...
Rina Dechter, Robert Mateescu
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 10 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
WWW
2011
ACM
13 years 4 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
13 years 21 days ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 5 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák