Sciweavers

1521 search results - page 234 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
CGO
2011
IEEE
14 years 7 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
PVLDB
2011
14 years 6 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
SAC
2011
ACM
14 years 6 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
AAAI
2011
14 years 3 months ago
Incorporating Boosted Regression Trees into Ecological Latent Variable Models
Important ecological phenomena are often observed indirectly. Consequently, probabilistic latent variable models provide an important tool, because they can include explicit model...
Rebecca A. Hutchinson, Li-Ping Liu, Thomas G. Diet...