Sciweavers

900 search results - page 137 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
MVA
2007
137views Computer Vision» more  MVA 2007»
13 years 10 months ago
Fingerprint Core and Delta Detection by Candidate Analysis
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
Tomohiko Ohtsuka, Daisuke Watanabe, Hiroyuki Aoki
CCGRID
2010
IEEE
13 years 9 months ago
A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
Frédéric Desprez, Frédé...
JUCS
2007
122views more  JUCS 2007»
13 years 8 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
IPPS
2010
IEEE
13 years 6 months ago
Meta-scheduling in advance using red-black trees in heterogeneous Grids
Abstract--The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision...
Luis Tomás, Carmen Carrión, Blanca C...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau