Sciweavers

2752 search results - page 248 / 551
» Rounding to an Integral Program
Sort
View
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
16 years 7 months ago
Collective annotation of Wikipedia entities in web text
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
16 years 4 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
IWMM
2009
Springer
166views Hardware» more  IWMM 2009»
16 years 1 months ago
Garbage collection in the next C++ standard
: © Garbage Collection in the Next C++ Standard Hans-J. Boehm, Mike Spertus HP Laboratories HPL-2009-360 C++, garbage collection C++ has traditionally relied on manual memory mana...
Hans-Juergen Boehm, Mike Spertus
FOCS
2006
IEEE
16 years 19 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák