Sciweavers

1263 search results - page 206 / 253
» A* with Bounded Costs
Sort
View
PR
2008
85views more  PR 2008»
13 years 8 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
IJAHUC
2007
111views more  IJAHUC 2007»
13 years 8 months ago
Configuring node status in a two-phase tightly integrated mode for wireless sensor networks
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
Di Tian, Zhijun Lei, Nicolas D. Georganas
TKDE
2008
162views more  TKDE 2008»
13 years 8 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
JCO
2007
123views more  JCO 2007»
13 years 8 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
TPDS
2008
136views more  TPDS 2008»
13 years 8 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...