Sciweavers

7421 search results - page 212 / 1485
» In search of dependable design
Sort
View
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 6 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
IUI
2010
ACM
16 years 3 months ago
Tell me more, not just "more of the same"
The Web makes it possible for news readers to learn more about virtually any story that interests them. Media outlets and search engines typically augment their information with l...
Francisco Iacobelli, Larry Birnbaum, Kristian J. H...
FOCS
2007
IEEE
16 years 29 days 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
ICMI
2007
Springer
138views Biometrics» more  ICMI 2007»
16 years 24 days ago
Speech-filtered bubble ray: improving target acquisition on display walls
The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method...
Edward Tse, Mark S. Hancock, Saul Greenberg
MICRO
2005
IEEE
110views Hardware» more  MICRO 2005»
16 years 6 days ago
Scalable Store-Load Forwarding via Store Queue Index Prediction
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
Tingting Sha, Milo M. K. Martin, Amir Roth