Sciweavers

1439 search results - page 149 / 288
» Fast approximation of centrality
Sort
View
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 2 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
JCO
2006
234views more  JCO 2006»
15 years 22 days ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
152
Voted
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 10 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
116
Voted
SIGSOFT
2010
ACM
14 years 10 months ago
Developer fluency: achieving true mastery in software projects
Outsourcing and offshoring lead to a rapid influx of new developers in software projects. That, in turn, manifests in lower productivity and project delays. To address this common...
Minghui Zhou, Audris Mockus
93
Voted
MOR
2010
115views more  MOR 2010»
14 years 7 months ago
Directional Derivatives of Oblique Reflection Maps
Given an oblique reflection map and functions , Dlim (the space of functions that have left and right limits at every point), the directional derivative () of along , evaluate...
Avi Mandelbaum, Kavita Ramanan