Sciweavers

1466 search results - page 271 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
74
Voted
CIKM
2009
Springer
15 years 4 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
WWW
2011
ACM
14 years 4 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
IS
2010
14 years 8 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
ICEIS
2000
IEEE
15 years 2 months ago
A Holistic Information Systems Strategy for Organisational Management-HISSOM
Alignment of organisational strategy with Information Systems Strategy (ISS) has become critical as adoption of Information Systems (IS) over the last 50 years has escalated. IS c...
David Lanc, Lachlan M. MacKinnon
JMLR
2006
85views more  JMLR 2006»
14 years 9 months ago
Streamwise Feature Selection
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...