Sciweavers

1312 search results - page 140 / 263
» Formally Optimal Boxing
Sort
View
EOR
2006
130views more  EOR 2006»
13 years 9 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
IANDC
2006
101views more  IANDC 2006»
13 years 9 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte
JCP
2008
142views more  JCP 2008»
13 years 9 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
PAMI
2002
124views more  PAMI 2002»
13 years 9 months ago
Information Theoretic Sensor Data Selection for Active Object Recognition and State Estimation
We introduce a formalism for optimal sensor parameter selection for iterative state estimation in static systems. Our optimality criterion is the reduction of uncertainty in the st...
Joachim Denzler, Christopher M. Brown
MTA
2007
111views more  MTA 2007»
13 years 9 months ago
Story creation from heterogeneous data sources
There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we f...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...