Sciweavers

459 search results - page 60 / 92
» Approximation Algorithms for Buy-at-Bulk Geometric Network D...
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
COCOON
2005
Springer
14 years 2 months ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...
FOCS
2008
IEEE
14 years 3 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
CVPR
2005
IEEE
14 years 10 months ago
Learning a Similarity Metric Discriminatively, with Application to Face Verification
We present a method for training a similarity metric from data. The method can be used for recognition or verification applications where the number of categories is very large an...
Sumit Chopra, Raia Hadsell, Yann LeCun
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 10 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...