Sciweavers

3702 search results - page 40 / 741
» All Pairings Are in a Group
Sort
View
117
Voted
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 4 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
ACNS
2008
Springer
96views Cryptology» more  ACNS 2008»
15 years 2 months ago
Efficient Device Pairing Using "Human-Comparable" Synchronized Audiovisual Patterns
Abstract. "Pairing" is referred to as the operation of achieving authenticated key agreement between two human-operated devices over a short- or medium-range wireless com...
Ramnath Prasad, Nitesh Saxena
IJMMS
2008
90views more  IJMMS 2008»
15 years 15 days ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
FSTTCS
2005
Springer
15 years 6 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
PCI
2005
Springer
15 years 6 months ago
Closest Pair Queries with Spatial Constraints
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...