Sciweavers

1871 search results - page 108 / 375
» The Ephemeral Pairing Problem
Sort
View
EDOC
2009
IEEE
15 years 3 months ago
Aligning Business Process Models
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
NIPS
2007
15 years 23 days ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...
JAIR
2008
94views more  JAIR 2008»
14 years 11 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
MOR
2010
98views more  MOR 2010»
14 years 9 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
14 years 9 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou