Sciweavers

523 search results - page 96 / 105
» Decidability of string graphs
Sort
View
106
Voted
DAGM
2008
Springer
14 years 11 months ago
A Multiple Kernel Learning Approach to Joint Multi-class Object Detection
Most current methods for multi-class object classification and localization work as independent 1-vs-rest classifiers. They decide whether and where an object is visible in an imag...
Christoph H. Lampert, Matthew B. Blaschko
AAAI
2010
14 years 11 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
14 years 10 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
GRAPHICSINTERFACE
1996
14 years 10 months ago
Awareness Through Fisheye Views in Relaxed-WYSIWIS Groupware
Desktop conferencing systems are now shifting from strict view-sharing towards relaxed "what-you-see-iswhat-I-see" interfaces, where distributed participants in a real t...
Saul Greenberg, Carl Gutwin, Andy Cockburn
CORR
2006
Springer
128views Education» more  CORR 2006»
14 years 9 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo