Sciweavers

702 search results - page 137 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
SCN
2008
Springer
147views Communications» more  SCN 2008»
13 years 8 months ago
Privacy-preserving secure relative localization in vehicular networks
Relative location information helps build vehicle topology maps. Such maps provide location information of nearby vehicles to drivers. In building a vehicle topology, one must cons...
Lei Tang, Xiaoyan Hong, Phillip G. Bradford
ICALP
2007
Springer
14 years 2 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
BMCBI
2007
134views more  BMCBI 2007»
13 years 8 months ago
PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
Ji He, Xinbin Dai, Xuechun Zhao
ICDE
2011
IEEE
281views Database» more  ICDE 2011»
13 years 5 days ago
Declarative analysis of noisy information networks
—There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data ...
Walaa Eldin Moustafa, Galileo Namata, Amol Deshpan...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...