Sciweavers

1359 search results - page 253 / 272
» Probabilistic Points-to Analysis
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
On neighbor discovery in wireless networks with directional antennas
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
Sudarshan Vasudevan, James F. Kurose, Donald F. To...
ISIPTA
2005
IEEE
155views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Estimation of Chaotic Probabilities
A Chaotic Probability model is a usual set of probability measures, M, the totality of which is endowed with an objective, frequentist interpretation as opposed to being viewed as...
Leandro Chaves Rêgo, Terrence L. Fine
ITCC
2005
IEEE
14 years 2 months ago
A Web Recommendation System Based on Maximum Entropy
We propose a Web recommendation system based on a maximum entropy model. Under the maximum entropy principle, we can combine multiple levels of knowledge about users’ navigation...
Xin Jin, Bamshad Mobasher, Yanzan Zhou
MM
2005
ACM
145views Multimedia» more  MM 2005»
14 years 2 months ago
Multiple instance learning for labeling faces in broadcasting news video
Labeling faces in news video with their names is an interesting research problem which was previously solved using supervised methods that demand significant user efforts on lab...
Jun Yang 0003, Rong Yan, Alexander G. Hauptmann
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind