Sciweavers

7421 search results - page 1350 / 1485
» In search of dependable design
Sort
View
RECOMB
2002
Springer
16 years 6 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 6 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 6 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
16 years 6 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
« Prev « First page 1350 / 1485 Last » Next »