62 search results - page 10 / 13 » A branch-and-bound algorithm for the linear ordering problem... |
UAI
2008
13 years 8 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
TWC
2010
13 years 2 months ago
2010
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
AAAI
1998
13 years 8 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...