Sciweavers

6582 search results - page 121 / 1317
» The focus of attention problem
Sort
View
ORL
2008
99views more  ORL 2008»
15 years 6 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
TJS
2002
122views more  TJS 2002»
15 years 6 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
DESIRE
2010
15 years 1 months ago
Investigating visual analogies for visual insight problems
Much research has focused on the impact of analogies in insight problem solving, but less work has investigated how the visual analogies for insight are actually constructed. Thus...
Corina Sas, Eric Luchian, Linden J. Ball
EMMCVPR
2011
Springer
14 years 6 months ago
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Thomas Schoenemann, Yubin Kuang, Fredrik Kahl
ICSE
2003
IEEE-ACM
16 years 6 months ago
The Deployer's Problem: Configuring Application Servers for Performance and Reliability
Frameworks such as J2EE are designed to simplify the process of developing enterprise applications by handling much of the complexity of concurrency, transaction, and persistence ...
Mukund Raghavachari, Darrell Reimer, Robert D. Joh...