Sciweavers

176 search results - page 27 / 36
» Sorting and Selection with Random Costs
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
14 years 5 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
ICCD
2008
IEEE
117views Hardware» more  ICCD 2008»
14 years 4 months ago
Two dimensional highly associative level-two cache design
High associativity is important for level-two cache designs [9]. Implementing CAM-based Highly Associative Caches (CAM-HAC), however, is both costly in hardware and exhibits poor s...
Chuanjun Zhang, Bing Xue
INFOCOM
2009
IEEE
14 years 2 months ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
CEC
2007
IEEE
14 years 2 months ago
Evolvability and Redundancy in Shared Grammar Evolution
— Shared grammar evolution (SGE) is a novel scheme for representing and evolving a population of variablelength programs as a shared set of grammatical productions. Productions t...
Martin H. Luerssen, David M. W. Powers