Sciweavers

273 search results - page 41 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
AI
2008
Springer
13 years 7 months ago
Managing parallel inquiries in agents' two-sided search
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
David Sarne, Sarit Kraus
AROBOTS
2010
126views more  AROBOTS 2010»
13 years 7 months ago
Contact sensing and grasping performance of compliant hands
Limitations in modern sensing technologies result in large errors in sensed target object geometry and location in unstructured environments. As a result, positioning a robotic end...
Aaron M. Dollar, Leif P. Jentoft, Jason H. Gao, Ro...
ENTCS
2008
92views more  ENTCS 2008»
13 years 7 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
MM
2010
ACM
158views Multimedia» more  MM 2010»
13 years 5 months ago
Image segmentation with patch-pair density priors
In this paper, we investigate how an unlabeled image corpus can facilitate the segmentation of any given image. A simple yet efficient multi-task joint sparse representation model...
Xiaobai Liu, Jiashi Feng, Shuicheng Yan, Hai Jin
FOCS
2007
IEEE
14 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák