Sciweavers

1032 search results - page 72 / 207
» A Category of Explicit Fusions
Sort
View
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 2 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
SIGCOMM
2003
ACM
14 years 1 months ago
A comparison of hard-state and soft-state signaling protocols
One of the key infrastructure components in all telecommunication networks, ranging from the telephone network, to VC-oriented data networks, to the Internet, is its signaling sys...
Ping Ji, Zihui Ge, James F. Kurose, Donald F. Tows...
ATAL
2006
Springer
13 years 11 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
IMC
2007
ACM
13 years 9 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
CGF
2010
157views more  CGF 2010»
13 years 5 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen