Sciweavers

205 search results - page 4 / 41
» Aspects of Pairing Inversion
Sort
View
ICRA
2008
IEEE
113views Robotics» more  ICRA 2008»
13 years 11 months ago
Inverse agreement algorithms with application to swarm dispersion for multiple nonholonomic agents
— We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the ca...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
IEICET
2008
76views more  IEICET 2008»
13 years 5 months ago
All Pairings Are in a Group
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
Changan Zhao, Fangguo Zhang, Jiwu Huang
PG
2007
IEEE
13 years 11 months ago
Radiometric Compensation through Inverse Light Transport
Radiometric compensation techniques allow seamless projections onto complex everyday surfaces. Implemented with projector-camera systems they support the presentation of visual co...
Gordon Wetzstein, Oliver Bimber
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 7 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
13 years 12 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron