Sciweavers

849 search results - page 34 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 2 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
ICIP
2005
IEEE
14 years 9 months ago
Progressive bitstream transmission over tandem channels
We propose a novel distortion minimization technique for the transmission of a packetized progressive bitstream. We consider tandem channels introducing bit errors and packet eras...
Farzad Etemadi, Homayoun Yousefi'zadeh, Hamid Jafa...
ICFCA
2010
Springer
14 years 2 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
IJAC
2002
128views more  IJAC 2002»
13 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki