Sciweavers

205 search results - page 26 / 41
» On Approximation Algorithms for Hierarchical MAX-SAT
Sort
View
ATAL
2011
Springer
13 years 11 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
15 years 6 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber
VMV
2003
146views Visualization» more  VMV 2003»
15 years 1 months ago
ADB-Trees: Controlling the Error of Time-Critical Collision Detection
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...
Jan Klein, Gabriel Zachmann
MOBIHOC
2006
ACM
15 years 11 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
ICIP
2000
IEEE
16 years 1 months ago
Model-Aided Coding of Multi-Viewpoint Image Data
The paper presents a novel coding technique based on approximate geometry for images taken from arbitrary recording positions around a 3-D scene. Such data structures occur in ima...
Marcus A. Magnor, Peter Eisert, Bernd Girod