1731 search results - page 212 / 347 » Maximum likelihood analysis of algorithms and data structure... |
DAWAK
2001
Springer
14 years 16 days ago
2001
Springer
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
IJON
2008
13 years 8 months ago
2008
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
NIPS
2003
13 years 9 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...