Sciweavers

58 search results - page 10 / 12
» Variations of Y-dominating functions on graphs
Sort
View
ICML
2006
IEEE
15 years 11 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
SIROCCO
2004
15 years 10 days ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
ALMOB
2006
138views more  ALMOB 2006»
14 years 11 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
IPMI
2009
Springer
15 years 11 months ago
Inverse-Consistent Surface Mapping With Laplace-Beltrami Eigen-Features
Abstract. We propose in this work a novel variational method for computing maps between surfaces by combining informative geometric features and regularizing forces including inver...
Arthur W. Toga, Jonathan H. Morra, Paul M. Thompso...
102
Voted
QEST
2010
IEEE
14 years 8 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...