Sciweavers

4761 search results - page 158 / 953
» Generalizing Boundary Points
Sort
View
132
Voted
ECCV
2010
Springer
15 years 8 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
SSD
2001
Springer
113views Database» more  SSD 2001»
15 years 7 months ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
128
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...
Radha Krishna Ganti, Jeffrey G. Andrews, Martin Ha...
116
Voted
IPL
2006
87views more  IPL 2006»
15 years 3 months ago
Strongly secure ramp secret sharing schemes for general access structures
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly...
Mitsugu Iwamoto, Hirosuke Yamamoto
126
Voted
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 3 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman