2107 search results - page 43 / 422 » Computing Small Search Numbers in Linear Time |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
ECP
1997
Springer
13 years 12 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
BMCBI
2008
13 years 7 months ago
2008
Background: The analysis of expressed sequence tags (EST) offers a rapid and cost effective approach to elucidate the transcriptome of an organism, but requires several computatio...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...