Sciweavers

11160 search results - page 247 / 2232
» Incompleteness in a General Setting
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICIP
1999
IEEE
15 years 10 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
CORR
2007
Springer
183views Education» more  CORR 2007»
15 years 5 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor
PAMI
2006
145views more  PAMI 2006»
15 years 5 months ago
Reflectance Sharing: Predicting Appearance from a Sparse Set of Images of a Known Shape
Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of vi...
Todd Zickler, Ravi Ramamoorthi, Sebastian Enrique,...
ANCS
2009
ACM
15 years 3 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...