Sciweavers

7758 search results - page 430 / 1552
» On the Number of Distributive Lattices
Sort
View
BIS
2011
289views Business» more  BIS 2011»
14 years 6 months ago
Advanced Resource Selection for Federated Enterprise Search
Distributed information retrieval is a well-known approach for accessing heterogeneous, highly autonomous sources of unstructured information. Selecting and querying only a number ...
Matthias Wauer, Daniel Schuster, Alexander Schill
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 7 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
HPDC
2005
IEEE
16 years 15 days ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
16 years 1 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
Alexandre Brandwajn, Thomas Begin
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
16 years 10 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud