Sciweavers

570 search results - page 105 / 114
» Robustness and Implementability of Timed Automata
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 8 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 2 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
BMCBI
2007
165views more  BMCBI 2007»
13 years 8 months ago
TagSmart: analysis and visualization for yeast mutant fitness data measured by tag microarrays
Background: A nearly complete collection of gene-deletion mutants (96% of annotated open reading frames) of the yeast Saccharomyces cerevisiae has been systematically constructed....
Chulyun Kim, Sangkyum Kim, Russell Dorer, Dan Xie,...
SECON
2010
IEEE
13 years 6 months ago
SAND: Sectored-Antenna Neighbor Discovery Protocol for Wireless Networks
Abstract--Directional antennas offer many potential advantages for wireless networks such as increased network capacity, extended transmission range and reduced energy consumption....
Emad Felemban, Robert Murawski, Eylem Ekici, Sangj...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield