Sciweavers

1887 search results - page 282 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ANCS
2006
ACM
13 years 11 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
VLDB
1994
ACM
129views Database» more  VLDB 1994»
13 years 12 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
IPM
2007
158views more  IPM 2007»
13 years 7 months ago
Validation and interpretation of Web users' sessions clusters
Understanding users’ navigation on the Web is important towards improving the quality of information and the speed of accessing large-scale Web data sources. Clustering of users...
George Pallis, Lefteris Angelis, Athena Vakali
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Empirical mechanism design: methods, with application to a supply-chain scenario
Our proposed methods employ learning and search techniques to estimate outcome features of interest as a function of mechanism parameter settings. We illustrate our approach with ...
Yevgeniy Vorobeychik, Christopher Kiekintveld, Mic...
ATAL
2007
Springer
14 years 2 months ago
Incentive compatible ranking systems
Ranking systems are a fundamental ingredient of multi-agent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished p...
Alon Altman, Moshe Tennenholtz