![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Baichen Chen
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
- [j3]Baichen Chen, Weifa Liang
, Jeffrey Xu Yu:
Energy-efficient top-k query evaluation and maintenance in wireless sensor networks. Wirel. Networks 20(4): 591-610 (2014) - 2012
- [j2]Baichen Chen, Weifa Liang
, Jeffrey Xu Yu:
Energy-efficient skyline query optimization in wireless sensor networks. Wirel. Networks 18(8): 985-1004 (2012) - 2011
- [j1]Weifa Liang
, Baichen Chen, Jeffrey Xu Yu:
Top-k query evaluation in sensor networks under query response time constraint. Inf. Sci. 181(4): 869-882 (2011)
Conference and Workshop Papers
- 2012
- [c12]Rui Zhou
, Chengfei Liu
, Jeffrey Xu Yu, Weifa Liang
, Baichen Chen, Jianxin Li
:
Finding maximal k-edge-connected subgraphs from a large graph. EDBT 2012: 480-491 - 2011
- [c11]Baichen Chen, Weifa Liang
, Geyong Min:
Top-k Query Evaluation in Sensor Networks with the Guaranteed Accuracy of Query Results. DEXA (1) 2011: 156-171 - 2010
- [c10]Baichen Chen, Geyong Min:
Robust Top-k Query Evaluation in Wireless Sensor Networks. CIT 2010: 660-667 - [c9]Baichen Chen, Weifa Liang
, Rui Zhou
, Jeffrey Xu Yu:
Energy-efficient top-k query processing in wireless sensor networks. CIKM 2010: 329-338 - [c8]Baichen Chen, Weifa Liang
, Jeffrey Xu Yu:
Online Time Interval Top-k Queries in Wireless Sensor Networks. Mobile Data Management 2010: 177-182 - 2009
- [c7]Baichen Chen, Weifa Liang
, Jeffrey Xu Yu:
Progressive skyline query evaluation and maintenance in wireless sensor networks. CIKM 2009: 1445-1448 - [c6]Baichen Chen, Weifa Liang
:
Progressive Skyline Query Processing in Wireless Sensor Networks. MSN 2009: 17-24 - 2008
- [c5]Weifa Liang
, Baichen Chen, Jeffrey Xu Yu:
Energy-efficient skyline query processing and maintenance in sensor networks. CIKM 2008: 1471-1472 - [c4]Weifa Liang
, Baichen Chen, Jeffrey Xu Yu:
Response Time Constrained Top-k Query Evaluation in Sensor Networks. ICPADS 2008: 575-582 - 2006
- [c3]Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen, Changyong Yu, Yi Zhao, Ge Yu:
Partition Frequency Distance based Filter Method for Finding Approximate Repetitions in DNA Sequences. BIBE 2006: 45-52 - [c2]Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen, Yi Zhao:
A New Method for Finding Approximate Repetitions in DNA Sequences. WAIM 2006: 397-409 - 2005
- [c1]Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen:
Finding LPRs in DNA Sequence Based on a New Index - SUA. BIBE 2005: 281-284
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint