Sciweavers

588 search results - page 31 / 118
» Positive higher-order queries
Sort
View
ALT
2001
Springer
15 years 10 months ago
Real-Valued Multiple-Instance Learning with Queries
While there has been a significant amount of theoretical and empirical research on the multiple-instance learning model, most of this research is for concept learning. However, f...
Daniel R. Dooly, Sally A. Goldman, Stephen Kwek
71
Voted
CGF
2005
99views more  CGF 2005»
15 years 1 months ago
N-Buffers for efficient depth map query
We introduce the N-buffer as a tool for multiresolution depth map representation. This neighborhood buffer encodes the value and position of local depth extrema at different scale...
Xavier Décoret
EDBT
2012
ACM
216views Database» more  EDBT 2012»
13 years 4 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
187
Voted
JCST
2010
155views more  JCST 2010»
14 years 8 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
147
Voted
ECCC
2011
188views ECommerce» more  ECCC 2011»
14 years 8 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills