4047 search results - page 355 / 810 » Some Properties and Some Problems on Set Functors |
189
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
157
click to vote
COLT
2004
Springer
16 years 1 days ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
186
click to vote
FSTTCS
2004
Springer
16 years 17 hour ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
136
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
186
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...