Sciweavers

1405 search results - page 128 / 281
» Popularity at Minimum Cost
Sort
View
IMA
2001
Springer
134views Cryptology» more  IMA 2001»
15 years 9 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
IGIS
1994
145views GIS» more  IGIS 1994»
15 years 8 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
AINTEC
2006
Springer
15 years 8 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 8 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
MICCAI
2000
Springer
15 years 8 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly