4047 search results - page 62 / 810 » Some Properties and Some Problems on Set Functors |
TCS
1998
14 years 11 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...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
124
click to vote
NEUROSCIENCE
2001
Springer
15 years 4 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
LREC
2008
15 years 1 months ago
2008
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...