Sciweavers

893 search results - page 116 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
EMMCVPR
2011
Springer
12 years 8 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
CSCLP
2003
Springer
14 years 2 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings
ISVLSI
2002
IEEE
129views VLSI» more  ISVLSI 2002»
14 years 1 months ago
Accelerating Retiming Under the Coupled-Edge Timing Model
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
Ingmar Neumann, Kolja Sulimma, Wolfgang Kunz
TALG
2008
67views more  TALG 2008»
13 years 8 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
CLEF
2009
Springer
13 years 6 months ago
Overview of the CLEF 2009 Robot Vision Track
The robot vision task has been proposed to the ImageCLEF participants for the first time in 2009. The task attracted a considerable attention, with 19 inscribed research groups, 7...
Andrzej Pronobis, Li Xing, Barbara Caputo