1511 search results - page 139 / 303 » Randomness, lowness and degrees |
163
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
153
click to vote
IJCAI
2007
15 years 7 months ago
2007
In order to evaluate ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results with some reference. The most prominent comparis...
161
click to vote
ACE
2004
15 years 7 months ago
2004
This paper analyses the cognitive difficulty of six courses that may be taken as credit towards an IT degree offered by a regional Australian University. The assessment requiremen...
155
click to vote
ECIS
2000
15 years 7 months ago
2000
As electronic commerce will increase, players will increasingly wish to have signed documents and strong encryption. According to current knowledge, it must be expected that the co...
188
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we describe a new approach to cope with packet loss in speech coders. The idea is to split the information present in each speech packet into two components, one to...