Sciweavers

12194 search results - page 2117 / 2439
» Numberings Optimal for Learning
Sort
View
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
15 years 10 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
ACCV
2007
Springer
15 years 10 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
ALGOSENSORS
2007
Springer
15 years 10 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
IPMU
2010
Springer
15 years 10 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
CLUSTER
2007
IEEE
15 years 10 months ago
A feasibility analysis of power-awareness and energy minimization in modern interconnects for high-performance computing
High-performance computing (HPC) systems consume a significant amount of power, resulting in high operational costs, reduced reliability, and wasting of natural resources. Therefor...
Reza Zamani, Ahmad Afsahi, Ying Qian, V. Carl Hama...
« Prev « First page 2117 / 2439 Last » Next »