Sciweavers

973 search results - page 151 / 195
» New Bounds on Crossing Numbers
Sort
View
GIS
2005
ACM
16 years 7 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ALT
2008
Springer
16 years 3 months ago
Learning with Temporary Memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
Steffen Lange, Samuel E. Moelius, Sandra Zilles
ALT
2002
Springer
16 years 3 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
GLOBECOM
2009
IEEE
16 years 26 days ago
Accelerating Initialization for Sensor Networks
—Initialization is an indispensable process for wireless sensor networks since newly deployed sensors lack a reliable infrastructure for communication. Many efforts have been mad...
Linghe Kong, Luoyi Fu, Xuemei Liu, Min-You Wu
ICASSP
2009
IEEE
16 years 26 days ago
Analyzing Least Squares and Kalman Filtered Compressed Sensing
In recent work, we studied the problem of causally reconstructing time sequences of spatially sparse signals, with unknown and slow time-varying sparsity patterns, from a limited ...
Namrata Vaswani