Sciweavers

2403 search results - page 106 / 481
» Optimal Randomized RANSAC
Sort
View
ICALP
2005
Springer
15 years 11 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 10 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
ICMCS
1998
IEEE
157views Multimedia» more  ICMCS 1998»
15 years 10 months ago
Compressed Domain Transcoding of MPEG
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...
Soam Acharya, Brian C. Smith
COMCOM
2006
147views more  COMCOM 2006»
15 years 6 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
ECCV
2008
Springer
16 years 8 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher