Sciweavers

1897 search results - page 281 / 380
» Mining Chains of Relations
Sort
View
149
Voted
CP
2004
Springer
15 years 11 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 6 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
164
Voted
WSDM
2009
ACM
117views Data Mining» more  WSDM 2009»
16 years 28 days ago
Query by document
We are experiencing an unprecedented increase of content contributed by users in forums such as blogs, social networking sites and microblogging services. Such abundance of conten...
Yin Yang, Nilesh Bansal, Wisam Dakka, Panagiotis G...
CAISE
2007
Springer
16 years 9 days ago
Declarative XML Data Cleaning with XClean
Data cleaning is the process of correcting anomalies in a data source, that may for instance be due to typographical errors, or duplicate representations of an entity. It is a cruc...
Melanie Weis, Ioana Manolescu