373 search results - page 44 / 75 » Identifying graphs from noisy and incomplete data |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
CHI
2008
ACM
14 years 8 months ago
2008
ACM
Despite the long history and consistent use of quantitative empirical methods to evaluate information visualization techniques and systems, our understanding of interface use rema...
USENIX
2007
13 years 10 months ago
2007
As the scope of personal data grows, it becomes increasingly difficult to find what we need when we need it. Desktop search tools provide a potential answer, but most existing too...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...