Sciweavers

1450 search results - page 186 / 290
» On the Complexity of Hardness Amplification
Sort
View
BIRTHDAY
2010
Springer
13 years 10 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
MM
2010
ACM
251views Multimedia» more  MM 2010»
13 years 9 months ago
A cognitive approach for effective coding and transmission of 3D video
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
Simone Milani, Giancarlo Calvagno
BMCBI
2007
141views more  BMCBI 2007»
13 years 9 months ago
A novel approach to detect hot-spots in large-scale multivariate data
Background: Progressive advances in the measurement of complex multifactorial components of biological processes involving both spatial and temporal domains have made it difficult...
Jianhua Wu, Keith M. Kendrick, Jianfeng Feng
IJRR
2008
139views more  IJRR 2008»
13 years 9 months ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal
IVC
2006
227views more  IVC 2006»
13 years 9 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu