Sciweavers

995 search results - page 70 / 199
» Wire-speed total order
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
ICIP
2007
IEEE
14 years 10 months ago
Adaptive Hash-Based Side Information Exploitation for Efficient Wyner-Ziv Video Coding
Wyner-Ziv video coding is a lossy source coding paradigm where the video statistics are exploited, partially or totally at the decoder. The side information represents a noisy ver...
Fernando Pereira, João Ascenso
DAC
2001
ACM
14 years 9 months ago
A2BC: Adaptive Address Bus Coding for Low Power Deep Sub-Micron Designs
Due to larger buses (length, width) and deep sub-micron effects where coupling capacitances between bus lines are in the same order of magnitude as base capacitances, power consum...
Haris Lekatsas, Jörg Henkel
ICML
2006
IEEE
14 years 9 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ICML
2009
IEEE
14 years 3 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier