15033 search results - page 2883 / 3007 » Complexity Theory and Algorithms |
132
click to vote
IDA
2002
Springer
15 years 3 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
159
click to vote
AC
1998
Springer
15 years 3 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
148
click to vote
TCAD
1998
15 years 3 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
140
Voted
TCS
1998
15 years 3 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
131
click to vote
PAMI
2007
15 years 3 months ago
2007
Most image registration problems are formulated in an asymmetric fashion. Given a pair of images, one is implicitly or explicitly regarded as a template, and warped onto the other...