Sciweavers

1523 search results - page 260 / 305
» The Computational Complexity of Linear Optics
Sort
View
ICMCS
2005
IEEE
187views Multimedia» more  ICMCS 2005»
14 years 1 months ago
A 3D Predict Hexagon Search Algorithm for Fast Block Motion Estimation on H.264 Video Coding
In the upcoming video coding standard, MPEG-4 AVC/JVT/H.264, motion estimation is allowed to use multiple references and multiple block sizes to improve the rate-distortion perfor...
Tsung-Han Tsai, Yu-Nan Pan
WONS
2005
IEEE
14 years 1 months ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...
GD
2005
Springer
14 years 1 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
GD
2005
Springer
14 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
LACL
2005
Springer
14 years 1 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler