1091 search results - page 128 / 219 » Approximation in Databases |
166
click to vote
SSD
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
168
click to vote
MICAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
162
click to vote
PAKDD
2004
ACM
15 years 11 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
159
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
170
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...