Sciweavers

649 search results - page 94 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
CP
2007
Springer
14 years 3 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Optimization
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
Robert Mateescu, Radu Marinescu 0002, Rina Dechter
ICALP
2003
Springer
14 years 2 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
CVPR
2000
IEEE
14 years 1 months ago
Perceptual Grouping and Segmentation by Stochastic Clustering
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
Yoram Gdalyahu, Noam Shental, Daphna Weinshall
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 2 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang