Sciweavers

705 search results - page 109 / 141
» Approximating Extended Answer Sets
Sort
View
ICFP
2007
ACM
15 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
DOLAP
2003
ACM
15 years 2 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
WWW
2003
ACM
15 years 10 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
74
Voted
WEBDB
2005
Springer
88views Database» more  WEBDB 2005»
15 years 3 months ago
Vague Content and Structure (VCAS) Retrieval for Document-centric XML Collections
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
Shaorong Liu, Wesley W. Chu, Ruzan Shahinian
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 1 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman