Sciweavers

3204 search results - page 326 / 641
» The b-chromatic Number of a Graph
Sort
View
PVLDB
2010
129views more  PVLDB 2010»
15 years 5 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
16 years 8 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
GLOBECOM
2006
IEEE
16 years 26 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 8 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
16 years 4 days 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...