Sciweavers

4277 search results - page 449 / 856
» On Multiple Linear Approximations
Sort
View
COLT
2007
Springer
15 years 10 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
132
Voted
ICLP
2007
Springer
15 years 10 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
15 years 10 months ago
A Bayesian Approach to Building Footprint Extraction from Aerial LIDAR Data
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
Oliver Wang, Suresh K. Lodha, David P. Helmbold
175
Voted
SMI
2006
IEEE
186views Image Analysis» more  SMI 2006»
15 years 10 months ago
BSP Shapes
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
Carsten Stoll, Hans-Peter Seidel, Marc Alexa
RTSS
2005
IEEE
15 years 9 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo