Sciweavers

5580 search results - page 724 / 1116
» Randomized priority algorithms
Sort
View
CEC
2010
IEEE
14 years 7 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
16 years 4 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
ICCD
2008
IEEE
120views Hardware» more  ICCD 2008»
16 years 28 days ago
Near-optimal oblivious routing on three-dimensional mesh networks
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
Rohit Sunkam Ramanujam, Bill Lin
INFOCOM
2008
IEEE
15 years 10 months ago
Balanced Relay Allocation on Heterogeneous Unstructured Overlays
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
Hung Xuan Nguyen, Daniel R. Figueiredo, Matthias G...
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
15 years 10 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz