3875 search results - page 551 / 775 » Approximation algorithms for the 0-extension problem |
192
click to vote
WSCG
2004
15 years 8 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
197
click to vote
NIPS
2000
15 years 8 months ago
2000
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. Effective models of human dynamics can be learned from motion capture data usi...
180
click to vote
JALC
2007
15 years 6 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
227
click to vote
VTC
2008
IEEE
16 years 29 days ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
145
click to vote
ESA
2007
Springer
16 years 22 days ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...