Sciweavers

9949 search results - page 1591 / 1990
» On the Network Complexity of Selection
Sort
View
APVIS
2007
15 years 8 months ago
Labeling collinear sites
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
ECEH
2007
120views Healthcare» more  ECEH 2007»
15 years 8 months ago
Strategies for a Systematical Patient Identification
: The growing demand for informational self-determination of patients will not only result in a stronger participation in therapeutic decision making hence causing a change in the ...
Tobias Mettler, René Fitterer, Peter Rohner
HCI
2007
15 years 8 months ago
Tracing Conceptual and Geospatial Diffusion of Knowledge
Understanding the dynamics of knowledge diffusion has profound theoretical and practical implications across a wide variety of domains, ranging from scientific disciplines to educa...
Chaomei Chen, Weizhong Zhu, Brian M. Tomaszewski, ...
NIPS
2008
15 years 8 months ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
« Prev « First page 1591 / 1990 Last » Next »