Sciweavers

2514 search results - page 326 / 503
» On the Computation of Approximations of Database Queries
Sort
View
PVLDB
2010
112views more  PVLDB 2010»
15 years 5 months ago
Querying Probabilistic Information Extraction
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
16 years 4 months ago
Progressive Result Generation for Multi-Criteria Decision Support Queries
— Multi-criteria decision support (MCDS) is crucial in many business and web applications such as web searches, B2B portals and on-line commerce. Such MCDS applications need to r...
Elke A. Rundensteiner, Venkatesh Raghavan
CIKM
2009
Springer
16 years 1 months ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang
WSNA
2003
ACM
16 years 1 days ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
FOCS
2007
IEEE
16 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák