Sciweavers

215 search results - page 35 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
CVPR
2010
IEEE
14 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ACSC
2008
IEEE
14 years 11 months ago
An efficient hash-based algorithm for minimal k-anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
14 years 9 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 9 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
INFOCOM
2008
IEEE
15 years 3 months ago
Dynamic Jamming Mitigation for Wireless Broadcast Networks
—Wireless communications are inherently symmetric; that is, it takes an attacker the same amount of power to modulate a signal as it does for a legitimate node to modulate the sa...
Jerry T. Chiang, Yih-Chun Hu