Sciweavers

874 search results - page 106 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
127
Voted
CVPR
2005
IEEE
16 years 4 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
132
Voted
JAIR
2011
123views more  JAIR 2011»
14 years 9 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
152
Voted
COMPSAC
2010
IEEE
15 years 20 days ago
Representing and Reasoning about Web Access Control Policies
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
Gail-Joon Ahn, Hongxin Hu, Joohyung Lee, Yunsong M...
100
Voted
CONEXT
2006
ACM
15 years 8 months ago
Compositional control of IP media
Abstract— In many IP media services, the media channels are point-to-point, dynamic, and set up with the participation of one or more application servers, even though the media p...
Pamela Zave, Eric Cheung
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 4 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...