962 search results - page 106 / 193 » Efficient Algorithms for Eulerian Extension |
214
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
150
click to vote
UAI
2001
15 years 5 months ago
2001
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
116
click to vote
AAAI
1994
15 years 5 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
120
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
177
click to vote
TC
2008
15 years 4 months ago
2008
As one of the fundamental issues in wireless sensor networks (WSNs), the sensor localization problem has recently received extensive attention. In this work, we investigate this pr...