1647 search results - page 238 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
175
click to vote
ECCV
2008
Springer
16 years 18 days ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
128
Voted
PVLDB
2010
15 years 21 days ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
87
Voted
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
134
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
126
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...