Sciweavers

3690 search results - page 375 / 738
» Computation with classical sequents
Sort
View
ICRA
2010
IEEE
118views Robotics» more  ICRA 2010»
15 years 5 months ago
Voronoi coverage of non-convex environments with a group of networked robots
— This paper presents a solution to decentralized Voronoi coverage in non-convex polygonal environments. We show that complications arise when existing approaches to Voronoi cove...
Andreas Breitenmoser, Mac Schwager, Jean-Claude Me...
IPL
2010
81views more  IPL 2010»
15 years 5 months ago
An alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
Torben Amtoft, Kelly Androutsopoulos, David Clark,...
JGT
2010
103views more  JGT 2010»
15 years 5 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
181
Voted
MCS
2010
Springer
15 years 5 months ago
A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, Da...
200
Voted
MST
2010
121views more  MST 2010»
15 years 5 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna