4983 search results - page 349 / 997 » order 2008 |
174
click to vote
EJC
2008
15 years 6 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
199
Voted
IANDC
2008
15 years 6 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
182
click to vote
IEICET
2008
15 years 6 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
191
click to vote
CGF
2006
15 years 6 months ago
2006
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
222
click to vote
TIP
2008
15 years 6 months ago
2008
Consider the problem of transmitting multiple video streams to fulfill a constant bandwidth constraint. The available bit budget needs to be distributed across the sequences in ord...