Sciweavers

16596 search results - page 2971 / 3320
» Generalized Assignment Problems
Sort
View
IJCV
2006
299views more  IJCV 2006»
15 years 7 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JACM
2008
91views more  JACM 2008»
15 years 7 months ago
On the minimization of XPath queries
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...
Sergio Flesca, Filippo Furfaro, Elio Masciari
IJPP
2006
145views more  IJPP 2006»
15 years 7 months ago
Deterministic Parallel Processing
Abstract. In order to address the problems faced in the wireless communications domain, picoChip has devised the picoArrayTM . The picoArrayTM is a tiled-processor architecture, co...
Gajinder Panesar, Daniel Towner, Andrew Duller, Al...
IJRR
2006
126views more  IJRR 2006»
15 years 7 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
JCT
2008
109views more  JCT 2008»
15 years 7 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
« Prev « First page 2971 / 3320 Last » Next »