Sciweavers

868 search results - page 61 / 174
» A general compression algorithm that supports fast searching
Sort
View
ICIP
2004
IEEE
14 years 10 months ago
Low-complexity macroblock mode selection for H.264/AVC encoders
Lagrangian minimization is one of the most powerful tools for Rate-Distortion optimal coding mode selection. However, in the latest video compression standard H.264/AVC, the total...
Hyungjoon Kim, Yucel Altunbasak
AI
1998
Springer
14 years 1 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 1 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGIR
2011
ACM
12 years 11 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...