Sciweavers

10414 search results - page 18 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
AIA
2006
13 years 10 months ago
Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
Perttu Laurinen, Pekka Siirtola, Juha Röning
RTAS
2010
IEEE
13 years 6 months ago
An Efficient Algorithm for Real-Time Divisible Load Scheduling
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
Anwar Mamat, Ying Lu, Jitender S. Deogun, Steve Go...
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 2 months ago
An efficient static algorithm for computing the soft error rates of combinational circuits
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
Rajeev R. Rao, Kaviraj Chopra, David Blaauw, Denni...
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 10 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
IPCO
1993
138views Optimization» more  IPCO 1993»
13 years 10 months ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...