Sciweavers

15416 search results - page 3082 / 3084
» Embeddings of Computable Structures
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 11 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
CHI
2004
ACM
14 years 11 months ago
ReMail: a reinvented email prototype
1 Electronic mail has become the most widely used business productivity application. However, people increasingly feel frustrated by their email. They are overwhelmed by the volum...
Steven L. Rohall, Dan Gruen, Paul Moody, Martin Wa...
ICS
2009
Tsinghua U.
14 years 5 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
PODC
2004
ACM
14 years 4 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
GI
2004
Springer
14 years 4 months ago
An Architecture Concept for Mobile P2P File Sharing Services
Abstract: File-sharing in mobile networks has differing demands to a P2P architecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. E...
Frank-Uwe Andersen, Hermann de Meer, Ivan Dedinski...
« Prev « First page 3082 / 3084 Last » Next »