Sciweavers

427 search results - page 78 / 86
» A Subexponential Bound for Linear Programming
Sort
View
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
13 years 6 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain
GLOBECOM
2010
IEEE
13 years 6 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
CVPR
2011
IEEE
13 years 4 months ago
Contour-Based Joint Clustering of Multiple Segmentations
We present an unsupervised, shape-based method for joint clustering of multiple image segmentations. Given two or more closely-related images, such as nearby frames in a video sequ...
Daniel Glasner, Shiv N. Vitaladevuni and Ronen Bas...
CVPR
2011
IEEE
13 years 4 months ago
Contour Based Joint Clustering of Multiple Segmentations
We present an unsupervised, shape-based method for joint clustering of multiple image segmentations. Given two or more closely-related images, such as nearby frames in a video seq...
Daniel Glasner, Shiv Vitaladevuni, Ronen Basri
TCAD
2010
168views more  TCAD 2010»
13 years 3 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha