361 search results - page 58 / 73 » Algorithms for Extracting Timeliness Graphs |
CGF
2007
13 years 8 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
IEEEPACT
1998
IEEE
14 years 27 days ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
SIGIR
2011
ACM
12 years 11 months ago
2011
ACM
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
IJCAI
2003
13 years 10 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...