Sciweavers

2095 search results - page 340 / 419
» Improved pebbling bounds
Sort
View
MAAMAW
1993
Springer
14 years 2 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
ASPDAC
2007
ACM
82views Hardware» more  ASPDAC 2007»
14 years 2 months ago
Efficient BMC for Multi-Clock Systems with Clocked Specifications
- Current industry trends in system design -- multiple clocks, clocks with arbitrary frequency ratios, multi-phased clocks, gated clocks, and level-sensitive latches, combined with...
Malay K. Ganai, Aarti Gupta
COLT
2007
Springer
14 years 1 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
ECCV
2010
Springer
14 years 1 months ago
Max-Margin Dictionary Learning for Multiclass Image Categorization
Abstract. Visual dictionary learning and base (binary) classifier training are two basic problems for the recently most popular image categorization framework, which is based on t...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo