1451 search results - page 167 / 291 » Order independence and rationalizability |
176
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
159
click to vote
BNCOD
2007
15 years 7 months ago
2007
Abstract. Information Extraction, the process of eliciting data from natural language documents, usually relies on the ability to parse the document and then to detect the meaning ...
185
click to vote
FCS
2007
15 years 7 months ago
2007
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
168
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
184
click to vote
RIAO
2000
15 years 7 months ago
2000
Face-to-face meetings usually encompass several modalities including speech, gesture, handwriting, and person identification. Recognition and integration of each of these modaliti...