Sciweavers

15351 search results - page 457 / 3071
» The information bottleneck method
Sort
View
ATAL
2003
Springer
15 years 9 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ICARCV
2002
IEEE
166views Robotics» more  ICARCV 2002»
15 years 9 months ago
Similarity measure determination from NURBS-warping method
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
Kim Meng Liang, Mandava Rajeswari, Bee Ee Khoo
INFOCOM
1989
IEEE
15 years 7 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom
NOSSDAV
2010
Springer
15 years 7 months ago
Randomised pair comparison: an economic and robust method for audiovisual quality assessment
Subjective quality perception studies with human observers are essential for multimedia system design. Such studies are known to be expensive and difficult to administer. They req...
Alexander Eichhorn, Pengpeng Ni, Ragnhild Eg
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 5 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...