Sciweavers

849 search results - page 107 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 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»
14 years 6 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ü...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 2 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SRDS
1998
IEEE
14 years 1 months ago
A Data Allocation Algorithm for Distributed Hypermedia Documents
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 9 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...