4047 search results - page 767 / 810 » Some Properties and Some Problems on Set Functors |
176
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
130
click to vote
IJAR
2010
15 years 1 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
164
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
266
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
132
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...