Sciweavers

1795 search results - page 352 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
IJCAI
1989
13 years 9 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 9 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ATAL
2010
Springer
13 years 9 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
ICASSP
2010
IEEE
13 years 8 months ago
High order motion interpolation for side information improvement in DVC
A key step in distributed video coding is the generation of the side information (SI) i.e. the estimation of the Wyner-Ziv frame (WZF). This step is also frequently called image i...
Giovanni Petrazzuoli, Marco Cagnazzo, Béatr...
ADT
2008
13 years 8 months ago
A service-oriented admission control strategy for class-based IP networks
The clear trend toward the integration of current and emerging applications and services in the Internet launches new demands on service deployment and management. Distributed serv...
Solange Rito Lima, Paulo Carvalho, Vasco Freitas