Sciweavers

542 search results - page 15 / 109
» The Denjoy alternative for computable functions
Sort
View
AAAI
2004
15 years 7 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam
GLOBECOM
2007
IEEE
16 years 10 days ago
Contraction Approach to Power Control, with Non-Monotonic Applications
Abstract—In wireless networks, monotonic, strictly subhomogeneous functions have been used to analyze power control algorithms. We provide an alternative analysis based on the ob...
Carl J. Nuzman
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
15 years 10 months ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
CC
2005
Springer
118views System Software» more  CC 2005»
15 years 5 months ago
The complexity of constructing pseudorandom generators from hard functions
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
Emanuele Viola
PAMI
2011
15 years 29 days ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev