Sciweavers

429 search results - page 48 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
COLT
2008
Springer
14 years 11 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
TWC
2008
80views more  TWC 2008»
14 years 9 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
15 years 10 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
SIAMIS
2011
14 years 4 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
15 years 4 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane