5100 search results - page 429 / 1020 » The Linear Complexity of a Graph |
216
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
215
click to vote
ICWS
2004
IEEE
15 years 9 months ago
2004
IEEE
Service composition refers to the aggregation of services to build complex applications to achieve client requirements. It is an important challenge to make it possible for users ...
225
click to vote
DCC
2005
IEEE
16 years 7 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
220
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
194
click to vote
MFCS
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...