Sciweavers

1968 search results - page 281 / 394
» The Complexity of Valued Constraint Models
Sort
View
PAKDD
2005
ACM
160views Data Mining» more  PAKDD 2005»
15 years 3 months ago
Improving Mining Quality by Exploiting Data Dependency
The usefulness of the results produced by data mining methods can be critically impaired by several factors such as (1) low quality of data, including errors due to contamination, ...
Fang Chu, Yizhou Wang, Carlo Zaniolo, Douglas Stot...
SIGGRAPH
1996
ACM
15 years 2 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe
APIN
2004
97views more  APIN 2004»
14 years 9 months ago
FSfRT: Forecasting System for Red Tides
A hybrid neuro-symbolic problem-solving model is presented in which the aim is to forecast parameters of a complex and dynamic environment in an unsupervised way. In situations in ...
Florentino Fdez-Riverola, Juan M. Corchado
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
15 years 7 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 5 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...