Sciweavers

270 search results - page 37 / 54
» Matching graphs of Hypercubes and Complete Bipartite Graphs
Sort
View
JSAC
2011
116views more  JSAC 2011»
13 years 3 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
IPPS
2006
IEEE
14 years 2 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
3DOR
2008
13 years 11 months ago
Isometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
Mauro R. Ruggeri, Dietmar Saupe
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 10 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
14 years 10 days ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...