Sciweavers

3006 search results - page 516 / 602
» Dimensionality reduction and generalization
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 4 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
15 years 11 months ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 10 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
WADT
2004
Springer
15 years 9 months ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
122
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 7 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra