Sciweavers

3204 search results - page 255 / 641
» The Alcuin Number of a Graph
Sort
View
GLOBECOM
2006
IEEE
16 years 21 days ago
Toward Understanding the Behavior of BGP During Large-Scale Power Outages
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...
Jun Li, Zhen Wu, Eric Purpus
LCTRTS
2005
Springer
16 years 4 days ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
PRICAI
2004
Springer
15 years 12 months ago
The Happy Searcher: Challenges in Web Information Retrieval
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
Mehran Sahami, Vibhu O. Mittal, Shumeet Baluja, He...
SAC
2008
ACM
15 years 6 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...