Sciweavers

142 search results - page 12 / 29
» Computing Maximum-Scoring Segments in Almost Linear Time
Sort
View
SIROCCO
2007
14 years 11 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
74
Voted
ICIP
2007
IEEE
15 years 11 months ago
Distancecut: Interactive Segmentation and Matting of Images and Videos
An interactive algorithm for soft segmentation and matting of natural images and videos is presented in this paper. The technique follows and extends [10], where the user first ro...
Xue Bai, Guillermo Sapiro
ADHOCNOW
2009
Springer
14 years 10 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
GD
2004
Springer
15 years 3 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
RTCSA
2007
IEEE
15 years 3 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son