Sciweavers

1790 search results - page 356 / 358
» On Privacy Models for RFID
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
AI
2010
Springer
13 years 10 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
IJAR
2008
118views more  IJAR 2008»
13 years 9 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 9 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
IJMMS
2007
166views more  IJMMS 2007»
13 years 9 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...