Sciweavers

8695 search results - page 161 / 1739
» Making the Complex Simple
Sort
View
108
Voted
JEI
2000
133views more  JEI 2000»
15 years 27 days ago
Low complexity block motion estimation using morphological-based feature extraction and XOR operations
Motion estimation is a temporal image compression technique, where an n x n block of pixels in the current frame of a video sequence is represented by a motion vector with respect...
Thinh M. Le, R. Mason, Sethuraman Panchanathan
143
Voted
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 8 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
99
Voted
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
15 years 7 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
83
Voted
COCOON
2007
Springer
15 years 7 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
128
Voted
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 5 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf