41 search results - page 7 / 9 » Shortest Descending Paths through Given Faces |
JACM
2008
13 years 7 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
ICCV
2009
IEEE
15 years 13 days ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
CONSTRAINTS
2006
13 years 7 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
EOR
2007
13 years 7 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...