1731 search results - page 64 / 347 » Maximum likelihood analysis of algorithms and data structure... |
159
Voted
NIPS
2007
15 years 5 months ago
2007
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
111
click to vote
IJCNLP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present a deterministic dependency structure analyzer for Chinese. This analyzer implements two algorithms – Yamada and Nivre models – and two sorts of class...
114
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
157
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
133
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
We study blind estimation of transmission power of a node based on received power measurements obtained under wireless fading. Specifically, the setup consists of a set of monitor...