Sciweavers

207 search results - page 29 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
ICML
2006
IEEE
15 years 10 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
15 years 1 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
ICCAD
2003
IEEE
137views Hardware» more  ICCAD 2003»
15 years 7 months ago
Bus-Driven Floorplanning
In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus speciï...
Hua Xiang, Xiaoping Tang, Martin D. F. Wong
HICSS
2003
IEEE
138views Biometrics» more  HICSS 2003»
15 years 3 months ago
A Single Buyer-Single Supplier Bargaining Problem with Asymmetric Information - Theoretical Approach and Software Implementation
This paper is focused on the coordination of order and production policy between buyers and suppliers in supply chains. When a buyer and a supplier of an item work independently, ...
Eric Sucky