Sciweavers

1960 search results - page 217 / 392
» The Logic of Large Enough
Sort
View
102
Voted
CADE
2007
Springer
16 years 29 days ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
198
Voted
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 24 days ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
107
Voted
PODS
2007
ACM
139views Database» more  PODS 2007»
16 years 24 days ago
Management of probabilistic data: foundations and challenges
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
Nilesh N. Dalvi, Dan Suciu
96
Voted
CIKM
2009
Springer
15 years 7 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
IFSA
2007
Springer
110views Fuzzy Logic» more  IFSA 2007»
15 years 6 months ago
Selection Criteria for Fuzzy Unsupervised Learning: Applied to Market Segmentation
The use of unsupervised fuzzy learning methods produces a large number of alternative classifications. This paper presents and analyzes a series of criteria to select the most sui...
Germán Sánchez, Núria Agell, ...