Sciweavers

113 search results - page 14 / 23
» Determining the Significance of Item Order In Randomized Pro...
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
PVLDB
2010
84views more  PVLDB 2010»
13 years 6 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
TEC
2008
88views more  TEC 2008»
13 years 7 months ago
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal M...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 6 days ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
14 years 1 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck