Sciweavers

450 search results - page 72 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 5 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
15 years 9 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
CHI
2010
ACM
15 years 5 months ago
The true cost of unusable password policies: password use in the wild
HCI research published 10 years ago pointed out that many users cannot cope with the number and complexity of passwords, and resort to insecure workarounds as a consequence. We pr...
Philip Inglesant, Martina Angela Sasse
CIKM
2008
Springer
15 years 1 months ago
Viability of in-house datamarting approaches for population genetics analysis of snp genotypes
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
Jorge Amigo, Christopher Phillips, Antonio Salas
ECR
2007
116views more  ECR 2007»
14 years 11 months ago
Enabling assisted strategic negotiations in actual-world procurement scenarios
In the everyday business world, the sourcing process of multiple goods and services usually involves complex negotiations (via telephone, fax, etc) that include discussion of prod...
Jesús Cerquides, Maite López-S&aacut...