Sciweavers

1368 search results - page 169 / 274
» Avoiding Simplicity Is Complex
Sort
View
198
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PODS
2004
ACM
137views Database» more  PODS 2004»
16 years 2 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
EDBT
2004
ACM
110views Database» more  EDBT 2004»
16 years 2 months ago
Using Convolution to Mine Obscure Periodic Patterns in One Pass
The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior o...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
ICFP
2007
ACM
16 years 2 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
101
Voted
ICCD
2007
IEEE
206views Hardware» more  ICCD 2007»
15 years 11 months ago
SCAFFI: An intrachip FPGA asynchronous interface based on hard macros
Building fully synchronous VLSI circuits is becoming less viable as circuit geometries evolve. However, before the adoption of purely asynchronous strategies in VLSI design, globa...
Julian J. H. Pontes, Rafael Soares, Ewerson Carval...