Sciweavers

7066 search results - page 1412 / 1414
» Contact Relations with Applications
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
EDBT
2012
ACM
299views Database» more  EDBT 2012»
11 years 10 months ago
RecStore: an extensible and adaptive framework for online recommender queries inside the database engine
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...
Justin J. Levandoski, Mohamed Sarwat, Mohamed F. M...
AAAI
2012
11 years 9 months ago
Characterizing Multi-Agent Team Behavior from Partial Team Tracings: Evidence from the English Premier League
Real-world AI systems have been recently deployed which can automatically analyze the plan and tactics of tennis players. As the game-state is updated regularly at short intervals...
Patrick Lucey, Alina Bialkowski, Peter Carr, Eric ...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
« Prev « First page 1412 / 1414 Last » Next »