Sciweavers

1778 search results - page 323 / 356
» The Theory of Probabilistic Databases
Sort
View
MM
2010
ACM
162views Multimedia» more  MM 2010»
14 years 10 months ago
Interactive visual object search through mutual information maximization
Searching for small objects (e.g., logos) in images is a critical yet challenging problem. It becomes more difficult when target objects differ significantly from the query object...
Jingjing Meng, Junsong Yuan, Yuning Jiang, Nitya N...
RECSYS
2010
ACM
14 years 10 months ago
Incremental collaborative filtering via evolutionary co-clustering
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
Mohammad Khoshneshin, W. Nick Street
AI
2008
Springer
14 years 10 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
ENTCS
2008
120views more  ENTCS 2008»
14 years 10 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
JAPLL
2008
121views more  JAPLL 2008»
14 years 10 months ago
Reasoning with prioritized information by iterative aggregation of distance functions
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...
Ofer Arieli