14518 search results - page 2594 / 2904 » Two Problems for Sophistication |
165
click to vote
MASCOTS
2008
15 years 8 months ago
2008
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
167
click to vote
IJCAI
2007
15 years 8 months ago
2007
In this paper we revisit the classical NLP problem of prepositional phrase attachment (PPattachment). Given the pattern V −NP1−P −NP2 in the text, where V is verb, NP1 is a ...
192
click to vote
SIROCCO
2008
15 years 8 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
172
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
182
click to vote
RSS
2007
15 years 8 months ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...