Sciweavers

5608 search results - page 285 / 1122
» On the Theory of Matchgate Computations
Sort
View
DCG
2010
121views more  DCG 2010»
15 years 4 months ago
Compression Schemes, Stable Definable Families, and o-Minimal Structures
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
H. R. Johnson, M. C. Laskowski
TMC
2011
213views more  TMC 2011»
15 years 1 months ago
Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing
Abstract—We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provid...
R. J. La, Eunyoung Seo
SYMMETRY
2010
90views more  SYMMETRY 2010»
15 years 1 months ago
Orientational Sampling Schemes Based on Four Dimensional Polytopes
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
Salvatore Mamone, Giuseppe Pileio, Malcolm H. Levi...
COMBINATORICA
2011
14 years 6 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
IUI
2004
ACM
16 years 4 days ago
What would they think?: a computational model of attitudes
A key to improving at any task is frequent feedback from people whose opinions we care about: our family, friends, mentors, and the experts. However, such input is not usually ava...
Hugo Liu, Pattie Maes