Sciweavers

287 search results - page 23 / 58
» As We May Read: The Reading Appliance Revolution
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Biasing web search results for topic familiarity
Depending on a web searcher’s familiarity with a query’s target topic, it may be more appropriate to show her introductory or advanced documents. The TREC HARD [1] track defi...
Giridhar Kumaran, Rosie Jones, Omid Madani
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
15 years 1 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
14 years 9 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
BMCBI
2008
99views more  BMCBI 2008»
14 years 9 months ago
Binning sequences using very sparse labels within a metagenome
Background: In metagenomic studies, a process called binning is necessary to assign contigs that belong to multiple species to their respective phylogenetic groups. Most of the cu...
Chon-Kit Kenneth Chan, Arthur L. Hsu, Saman K. Hal...
JSYML
2000
103views more  JSYML 2000»
14 years 9 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon