2063 search results - page 244 / 413 » connection 2007 |
130
Voted
NIPS
2004
15 years 6 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
167
click to vote
NIPS
2004
15 years 6 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
121
click to vote
OPODIS
2004
15 years 6 months ago
2004
Topology control protocols attempt to reduce the energy consumption of nodes in an ad-hoc wireless network while maintaining sufficient network connectivity. Topology control proto...
136
Voted
ICAI
2003
15 years 6 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
146
click to vote
SBBD
2001
15 years 6 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...