Sciweavers

6575 search results - page 1024 / 1315
» Specializing visualization algorithms
Sort
View
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
15 years 8 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
124
Voted
LCTRTS
2007
Springer
15 years 8 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
111
Voted
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
15 years 8 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
123
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
CASES
2006
ACM
15 years 8 months ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...
« Prev « First page 1024 / 1315 Last » Next »