Sciweavers

3894 search results - page 587 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
134
Voted
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 7 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
128
Voted
CCE
2006
15 years 3 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
135
Voted
ICML
2009
IEEE
16 years 4 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
113
Voted
IJCAI
2007
15 years 5 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
121
Voted
COR
2004
111views more  COR 2004»
15 years 3 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho