default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBahram Sadeghi Bigham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Zeinab Sedaghatjoo, Hossein Hosseinzadeh, Bahram Sadeghi Bigham:
Local Binary Pattern(LBP) Optimization for Feature Extraction. CoRR abs/2407.18665 (2024)- 2023
- [j14]Bahram Sadeghi Bigham
:
Minimum constraint removal problem for line segments is NP-hard. Discret. Math. Algorithms Appl. 15(1): 2250055:1-2250055:10 (2023) - [j13]Nima Jafarzadeh, Ahmad Jalili, Jafar Ahmad Abed Alzubi, Khosro Rezaee, Yang Liu, Mehdi Gheisari, Bahram Sadeghi Bigham, Amir Javadpour:
A novel buffering fault-tolerance approach for network on chip (NoC). IET Circuits Devices Syst. 17(4): 250-257 (2023) - 2022
- [j12]Bahram Sadeghi Bigham, S. Dolatikalan, Alireza Khastan:
Minimum landmarks for robot localization in orthogonal environments. Evol. Intell. 15(3): 2235-2238 (2022) - [c13]Simin Bakhshmand, Bahram Sadeghi Bigham, Mahdi Bohlouli:
Predicting Points of Interest with Social Relations and Geographical-Temporal Information. ISDA (2) 2022: 545-554 - 2021
- [i12]Bahram Sadeghi Bigham:
Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls. CoRR abs/2106.09974 (2021) - [i11]Kobra Nazari, Samaneh Mazaheri, Bahram Sadeghi Bigham:
Creating A New Color Space utilizing PSO and FCM to Perform Skin Detection by using Neural Network and ANFIS. CoRR abs/2106.11563 (2021) - [i10]Bahram Sadeghi Bigham:
Minimum Constraint Removal Problem for Line Segments is NP-hard. CoRR abs/2107.03140 (2021) - [i9]Bahram Sadeghi Bigham, Sahar Badri, Nazanin Padkan:
A new metaheuristic approach for the art gallery problem. CoRR abs/2107.05540 (2021) - [i8]Marzieh Eskandari, Bahram Sadeghi Bigham:
Lower Bound for Sculpture Garden Problem. CoRR abs/2107.08175 (2021) - [i7]Bahram Sadeghi Bigham, Mansoor Davoodi, Samaneh Mazaheri, Jalal Kheyrabadi:
Tiling Rectangles and the Plane using Squares of Integral Sides. CoRR abs/2110.00839 (2021) - [i6]Nazanin Padkan, Bahram Sadeghi Bigham, Mohammad Reza Faraji:
Fingerprint Matching using the Onion Peeling Approach and Turning Function. CoRR abs/2110.00958 (2021) - [i5]Bahram Sadeghi Bigham, Mahboubeh Fannakhosrow, Aliakbar Safipour, Mostafa Jafari, Khadijeh Chenari:
E-learning model for art education: Case study in Iran. CoRR abs/2110.03904 (2021) - 2020
- [j11]Bahram Sadeghi Bigham, Fariba Noorizadeh, Salman Khodayifar:
A polynomial time algorithm for big data in a special case of minimum constraint removal problem. Evol. Intell. 13(2): 247-254 (2020)
2010 – 2019
- 2018
- [j10]Farshad Bakhshandegan Moghaddam, Bahram Sadeghi Bigham:
EXTRA: EXpertise-Boosted Model for Trust-Based Recommendation System Based on Supervised Random Walk. Comput. Informatics 37(5): 1209-1230 (2018) - [j9]Armin Ghasem Azar, Mohsen Afsharchi, Mansoor Davoodi, Bahram Sadeghi Bigham:
A multi-objective market-driven framework for power matching in the smart grid. Eng. Appl. Artif. Intell. 70: 199-215 (2018) - [c12]Akbar Karimi, Ebrahim Ansari, Bahram Sadeghi Bigham:
Extracting an English-Persian Parallel Corpus from Comparable Corpora. LREC 2018 - [i4]Farzane Yahyanejad, Bahram Sadeghi Bigham:
Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location. CoRR abs/1808.06958 (2018) - [i3]Farzane Yahyanejad, Bahram Sadeghi Bigham:
Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem. CoRR abs/1808.06981 (2018) - 2017
- [j8]Farzaneh Moradkhani, Bahram Sadeghi Bigham:
A New Image Mining Approach for Detecting Micro-Calcification in Digital Mammograms. Appl. Artif. Intell. 31(5-6): 411-424 (2017) - [j7]Farhad Shamsfakhr, Bahram Sadeghi Bigham:
A neural network approach to navigation of a mobile robot and obstacle avoidance in dynamic and unknown environments. Turkish J. Electr. Eng. Comput. Sci. 25: 1629-1642 (2017) - [j6]Rozita Jamili Oskouei, Bahram Sadeghi Bigham:
Over-sampling via under-sampling in strongly imbalanced data. Int. J. Adv. Intell. Paradigms 9(1): 58-66 (2017) - [i2]Akbar Karimi, Ebrahim Ansari, Bahram Sadeghi Bigham:
Extracting an English-Persian Parallel Corpus from Comparable Corpora. CoRR abs/1711.00681 (2017) - 2016
- [j5]Masoumeh Khodaei, Bahram Sadeghi Bigham, Karim Faez:
Adaptive Data Hiding, Using Pixel-Value-Differencing and LSB Substitution. Cybern. Syst. 47(8): 617-628 (2016) - 2014
- [c11]Armin Ghasem Azar, Mansoor Davoodi, Mohsen Afsharchi, Bahram Sadeghi Bigham:
A Greedy Agent-Based Resource Allocation in the Smart Electricity Markets. AIAI 2014: 150-161 - [i1]Hamid A. Toussi, Bahram Sadeghi Bigham:
Design, Implementation and Evaluation of MTBDD based Fuzzy Sets and Binary Fuzzy Relations. CoRR abs/1403.1279 (2014) - 2013
- [j4]Arman Didandeh, Bahram Sadeghi Bigham, Mehdi Khosravian, Farshad Bakhshandegan Moghaddam:
Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities. Inf. Sci. 234: 203-216 (2013) - [j3]Ebrahim Ansari, Mohammad Hadi Sadreddini, Bahram Sadeghi Bigham, Fatemeh Alimardani:
A combinatorial cooperative-tabu search feature reduction approach. Sci. Iran. 20(3): 657-662 (2013) - 2012
- [j2]Bahram Sadeghi Bigham, Marzieh Eskandari, Maryam Tahmasbi:
Near-pole polar diagram of objects and duality. J. Comput. Sci. 3(3): 127-131 (2012) - 2011
- [c10]Rohollah Moosavi Tayebi, Samaneh Mazaheri, Bahram Sadeghi Bigham:
A new fingerprint matching approach using level 2 and level 3 features. C3S2E 2011: 73-81 - [c9]Samaneh Mazaheri, Bahram Sadeghi Bigham, Rohollah Moosavi Tayebi:
Fingerprint Matching Using an Onion Layer Algorithm of Computational Geometry Based on Level 3 Features. DICTAP (1) 2011: 302-314 - [c8]Parvin Abbasi, Bahram Sadeghi Bigham, Saeed Sarencheh:
Good's history and trust in electronic commerce. WCIT 2011: 827-832 - [c7]Saeed Sarencheh, Bahram Sadeghi Bigham:
An applicable master plan to develop city's information technology infrastructure. WCIT 2011: 840-847 - 2010
- [c6]Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Madadi:
An optimal solution for dynamic polar diagram. CCCG 2010: 51-54 - [c5]Malihe Jahani, Bahram Sadeghi Bigham, Abbas Askari:
An Ant Colony Algorithm for the Minimum Weight Triangulation. ICCSA Workshops 2010: 81-85
2000 – 2009
- 2008
- [j1]Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Ortega:
Dynamic polar diagram. Inf. Process. Lett. 109(2): 142-146 (2008) - [c4]Bahram Sadeghi Bigham, Sasha Chernin, Akram Madadi, Najmeh Madadi, Pedram Tavajoh:
Phishing Guard and Antivirus: A New Approach. Security and Management 2008: 309-312 - [c3]Seyed Reza Alisobhani, Ferial Mehrabanpoor, Yaser Nosrati, Bahram Sadeghi Bigham:
Data Encryption Based On Protein Synthesis. GEM 2008: 278-283 - 2007
- [c2]Sara Mohamadrezaei, Bahram Sadeghi Bigham:
Solving Semantic Problems in Chaff and Winnowing Problem by Using Cryptography. Security and Management 2007: 152-156 - [c1]Elnaz Bigdeli, Zeinab Bahmani, Bahram Sadeghi Bigham:
Applications of Chaos Model in Software Development Process. Software Engineering Research and Practice 2007: 59-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
